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!)
A070069 a(1) = 11; a(n) = smallest palindromic multiple of a(n-1). 5

%I #3 Mar 30 2012 17:30:43

%S 11,22,44,88,616,6776,88088,616616,232464232,21154245112,232696696232,

%T 21175399357112,21154245133154245112,232696696464696696232,

%U 21175399378287399357112,63386501441764911946714410568336

%N a(1) = 11; a(n) = smallest palindromic multiple of a(n-1).

%t e[1] = 11; e[n_] := e[n] = Block[{k = 2}, While[k*e[n - 1] != ToExpression[ StringReverse[ ToString[k*e[n - 1]]]], k++ ]; k*e[n - 1]]; Table[e[n], {n, 1, 12}]

%Y Cf. A068664 (from a(5) on) and this sequence (from a(4) on) coincide.

%Y Cf. A068664, A068665, A068666, A068667, A068668, A068971, A068972, A068973, A068974.

%K base,nonn

%O 1,1

%A _Robert G. Wilson v_, Apr 19 2002

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 April 19 18:05 EDT 2024. Contains 371798 sequences. (Running on oeis4.)