login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A225914 Position of the first occurrence of n in sequence A196942. 1
3, 7, 23, 71, 311, 461, 799, 1271, 719, 941, 967, 1151, 1783, 1847, 2659, 1621, 3067, 1663, 3583, 2467, 2851, 2551, 4051, 5741, 6239, 6373, 6271, 5927, 8627, 6841, 5603, 4201, 5581, 9901, 6037, 8423, 7487, 7123, 5867, 5791, 6011, 8539, 13119, 6367, 13327, 11863 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
a(n) is also the smallest positive integer such that the prime number order of p3 has to be n or larger when a(n) is written as a(n) = p1^m1 * p2^m2 * p3^m3 + p1^n1 * p2^n2 * p3^n3, where p1 < p2 < p3 are prime numbers and m1,m2,m3 and n1,n2,n3 are integers greater than or equal to zero.
LINKS
EXAMPLE
1 appears first at position 3 in A196942, so a(1)=3;
3 appears first at position 23 in A196942, so a(3)=23.
MATHEMATICA
max = 46; res = Table[0, {i, 1, max}]; i = 1; ct = 0; While[ct < max, i++; ref = i; Do[k = i - j; fj = Transpose[FactorInteger[j]][[1]]; fk = Transpose[FactorInteger[k]][[1]]; fpls = Union[fj, fk]; lf = Length[fpls]; If[lf <= 3, cd = fpls[[lf]]; If[cd < ref, ref = cd]], {j, Ceiling[i/2], i}]; tag = PrimePi[ref]; If[tag <= max, If[res[[tag]] == 0, res[[tag]] = i; ct++]]]; res
CROSSREFS
Sequence in context: A045723 A140456 A066768 * A062241 A000229 A133435
KEYWORD
nonn
AUTHOR
Lei Zhou, May 20 2013
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 3 11:14 EDT 2024. Contains 372207 sequences. (Running on oeis4.)