This site is supported by donations to The OEIS Foundation.



Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 4500 articles have referenced us, often saying "we would not have discovered this result without the OEIS".

(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A112296 Smret suoiverp eht fo mus fo esrever. 0


%S 9,9,81,99,891,9801,9801,19602,39204,79497,499851,548856,1077021,

%T 2274822,4459554,8909109,70282971,87111288,664223571,730645938,

%U 5791910751,6272012637,36351143631,49985258994,88971507999,789520249881

%N Smret suoiverp eht fo mus fo esrever.

%D Zak Seidov, Posting to Seq Fan mailing list, Nov 28 2005

%p a[0]:=9: S:=a[0]: for n from 1 to 30 do S1:=convert(S,base,10): c:=nops(S1): a[n]:=add(S1[c+1-j]*10^(j-1),j=1..c): S:=S+a[n]: od: seq(a[n],n=0..30); (Deutsch)

%K nonn

%O 1,1

%A _N. J. A. Sloane_, Nov 30 2005

%E More terms from _Emeric Deutsch_, Feb 03 2006

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

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

Last modified November 29 10:31 EST 2015. Contains 264643 sequences.