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

%I #11 Sep 25 2019 07:35:41

%S 9,99,1881,171171,1882881,306909603,11355655311,1033364633301,

%T 1034397997934301,10241574577547514201,10231343244544544234313201,

%U 112544775689989986577445211,1023144555797698967975554413201,102221350448336861989168633844053122201,11233003103852144358833233885344125830130033211

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

%t e[1] = 9; 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, 13}] - _Robert G. Wilson v_, Apr 19 2002

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

%K base,nonn

%O 1,1

%A _Amarnath Murthy_, Mar 01 2002

%E More terms from _Sascha Kurz_, Mar 27 2002

%E Edited by _N. J. A. Sloane_, Apr 19 2007

%E a(14)-a(15) from _Giovanni Resta_, Sep 25 2019

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 23 15:20 EDT 2024. Contains 371916 sequences. (Running on oeis4.)