Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A068664
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A068664 a(1) = 1, a(n) = smallest palindromic multiple of a(n-1). +0
10
1, 2, 4, 8, 88, 616, 6776, 88088, 616616, 232464232, 21154245112, 232696696232, 21175399357112, 21154245133154245112, 232696696464696696232, 21175399378287399357112, 63386501441764911946714410568336 (list; graph; listen)
OFFSET

1,2

MATHEMATICA

a=1; Print[a]; For[n = 2, n <= 15, n++, {an = a; k = 2; str = ToString[k*an]; rstr = StringReverse[str]; While[str != rstr, {k = k + 1; str = ToString[k*an]; rstr = StringReverse[str]; If[k*an > 10^20, {Print["Too big"]; Abort[]}]}]; a := k*an; Print[k, " ", a]; }]

CROSSREFS

A068667 (from a(3) on) and this sequence (from a(6) on) coincide.

Cf. A068665, A068666, A068667, A068668, A070069, A068971, A068972, A068973, A068974.

Sequence in context: A088114 A076886 A046385 this_sequence A018605 A058262 A018640

Adjacent sequences: A068661 A068662 A068663 this_sequence A068665 A068666 A068667

KEYWORD

base,nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Mar 01 2002.

EXTENSIONS

Extended and edited by John W. Layman (layman(AT)math.vt.edu), Mar 18 2002. Last two terms from David W. Wilson (davidwwilson(AT)comcast.net) and Patrick De Geest (pdg(AT)worldofnumbers.com), Mar 30 2002.

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research