[QUOTE=science_man_88;226226]now if I only I could be smart like you so I could build you that helpful program lol.[/QUOTE]

[i]I'm[/i] not smart enough to write that program, but maybe you are. You have a long way to go, though!

Here are some possibly-relevant papers in case you decide to think more about this:
[url=http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.132.8640&rep=rep1&type=pdf]mArachna – Ontology Engineering for Mathematical Natural Language Texts[/url]
[url=http://mathweb.org/projects/mws/pubs/mkm08.pdf]MathWebSearch 0.4: A Semantic Search Engine for Mathematics[/url]
etc.

[QUOTE=3.14159;226232]?a = a(n) = nextprime(10^n))[/QUOTE]

I'm sure it didn't say that -- it's not in the form of a valid closure. But if it said
[code]a(n) = nextprime(10^n)[/code]
then it would never return 2 for n >= 1 -- it's a constant, no randomness.

Now: Can we get back to the substitutions required to make the sieve for the k * n + 1?

[QUOTE=3.14159;226235]Now: Can we get back to the substitutions required to make the sieve for the k * n + 1?[/QUOTE]

Why don't you just download srsieve and use that? It'll be faster.

[QUOTE=CRGreathouse]Why don't you just download srsieve and use that? It'll be faster.[/QUOTE]

Because it can only sieve for Proth numbers.

[QUOTE=3.14159;226242]Because it can only sieve for Proth numbers.[/QUOTE]

It does more than Proth numbers. What, precisely, are you sieving for? Can you specify exactly for me?

[QUOTE=CRGreathouse]It does more than Proth numbers. What, precisely, are you sieving for? Can you specify exactly for me?
[/QUOTE]

k * n! + 1.

Maybe this?
[url]http://fatphil.org/maths/factorial/[/url]

Possibly even this?
[url]http://pgllr.mine.nu/software/fsieve/[/url]

[QUOTE=CRGreathouse]Maybe this?
[url]http://fatphil.org/maths/factorial/[/url]

Possibly even this?
[url]http://pgllr.mine.nu/software/fsieve/[/url][/QUOTE]

The first is source code, luckily I downloaded some freeware to deal with C source code.

[QUOTE=3.14159]The first is source code, luckily I downloaded some freeware to deal with C source code.[/QUOTE]

Nevermind that. I'm going to go to Generalized proths, using factorial and or primorial powers, just need a larger base range. Anything for that?

[QUOTE=3.14159;226258]Nevermind that. I'm going to go to Generalized proths, using factorial and or primorial powers, just need a larger base range. Anything for that?[/QUOTE]

I can never keep track of all the names (especially since some are contradictory... e.g. several definitions for generalized Fermats). What form are these?