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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A195187 a(1)=1 and recursively a(n+1) = R(1+(a(n))^3). 0
1, 2, 9, 37, 45605, 62102890005849, 50579867441435760410772290593896794615932 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Add one to the cube of the previous term, and reverse the digits in base 10 to obtain the next term. a(1)= 1, a(n+1) = A004086(1+A000578(a(n))). This is a flawed try to make the analogue to the exponent 3 as A193914 is to the exponent 2.

The number of digits is 1, 1, 1, 2, 5, 14, 41, 123, 369, 1105,... in the n=1st, 2nd, 3rd etc term.

LINKS

Table of n, a(n) for n=1..7.

FORMULA

a(n) = A004086(1+a(n-1)^3).

CROSSREFS

Cf. A000578, A004086.

Sequence in context: A218943 A122673 A139102 * A041515 A010750 A026591

Adjacent sequences:  A195184 A195185 A195186 * A195188 A195189 A195190

KEYWORD

nonn,base

AUTHOR

Jonathan Vos Post, Sep 12 2011

STATUS

approved

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 May 24 10:23 EDT 2013. Contains 225618 sequences.