login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A100475
Prime-th recurrence with reversal at each step.
0
1, 2, 3, 5, 11, 13, 14, 34, 931, 7037, 95017, 3549221, 75296795, 3518502151, 34778126848, 747746329129, 13428156340222, 728260738568834, 17205012007789762
OFFSET
0,2
COMMENTS
Starting at other than a(n) = 1, does this sequence ever go into a loop?
REFERENCES
Ball, W. W. R. and Coxeter, H. S. M. Mathematical Recreations and Essays, 13th ed. New York: Dover, pp. 14-15, 1987.
LINKS
Andrew Booker, The Nth Prime Page
Eric Weisstein's World of Mathematics, Reversal.
Eric Weisstein's World of Mathematics, Rosser's Theorem.
FORMULA
a(n) = reversal(a(n-1)th prime).
EXAMPLE
a(7) = 14 because a(6) = 13, the 13th prime is 41 and reversal(41) = 14.
MATHEMATICA
f[n_] := FromDigits[ Reverse[ IntegerDigits[ Prime[n]]]]; NestList[f, 1, 16] (* Robert G. Wilson v, Dec 02 2004 *)
NestList[IntegerReverse[Prime[#]]&, 1, 19] (* Harvey P. Dale, May 02 2022 *)
CROSSREFS
Sequence in context: A093902 A269004 A379316 * A187921 A275059 A072538
KEYWORD
nonn,base,more
AUTHOR
Jonathan Vos Post, Nov 22 2004
EXTENSIONS
a(15)-a(16) from Robert G. Wilson v, Dec 02 2004
a(17)-a(18) from Paul Zimmermann, Dec 04 2004, computed thanks to Deléglise-Rivat's program; confirmed by Marc Deléglise, Dec 09 2004
STATUS
approved