login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A073814 Smallest numbers such that A073813[n]=Prime[n];. 0
2, 4, 15, 33, 90, 129, 227, 288, 429, 694, 798, 1149, 1417, 1565, 1879, 2399, 2993, 3201, 3879, 4365, 4623, 5429, 6002, 6920, 8245 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

FORMULA

Min{x; c[x]-Max[URS[c[x]]]=p(n)}, p(n)=nth prime. See program.

EXAMPLE

a(6)=129 means that c[129]-Max[URS[c[129]]=Prime[6]: c[129]=169, Max[URS[169]]=Max{26,39,...,143,156}=156; difference=169-156=13=6th prime. Suspicion: A073813(n) is always prime number!

MATHEMATICA

c[x_] := FixedPoint[x+PrimePi[ # ]+1&, x]; tn[x_] := Table[j, {j, 1, x}]; di[x_] := Divisors[x]; rrs[x_] := Flatten[Position[GCD[tn[x], x], 1]]; rs[x_] := Union[rrs[x], di[x]]; urs[x_] := Complement[tn[x], rs[x]]; Do[s=c[n]-Max[urs[c[n]]]; If[s<101&&t[[s]]==0, t[[s]]=n], {n, 1, 10}]; t.

CROSSREFS

Cf. A045763, A073759, A002808, A073813.

Cf. A120389. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Aug 07 2008]

Sequence in context: A154906 A080623 A196260 * A181442 A007122 A005219

Adjacent sequences:  A073811 A073812 A073813 * A073815 A073816 A073817

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Aug 15 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 14:07 EST 2012. Contains 205623 sequences.