Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A068666
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A068666 a(1) = 5; a(n) = smallest palindromic multiple of a(n-1). +0
10
5, 55, 5005, 55055, 50155105, 5065665605, 50155155155105, 5464353998993534645, 541025148469303964841520145, 513016415223221833242338122322514610315 (list; graph; listen)
OFFSET

1,1

MATHEMATICA

a[1] = 5; a[n_] := a[n] = Block[{k = 2}, While[k*a[n - 1] != ToExpression[ StringReverse[ ToString[k*a[n - 1]]]], k++ ]; k*a[n - 1]]; Table[a[n], {n, 1, 9}]

CROSSREFS

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

Sequence in context: A126157 A105715 A111821 this_sequence A082780 A063855 A081785

Adjacent sequences: A068663 A068664 A068665 this_sequence A068667 A068668 A068669

KEYWORD

base,nonn,more

AUTHOR

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

EXTENSIONS

Corrected and extended by David W. Wilson (davidwwilson(AT)comcast.net) and Patrick De Geest (and edited by) (pdg(AT)worldofnumbers.com), Mar 30 2002.

Added new term a(10) = 513016415223221833242338122322514610315. - John Gustaf Stebbins (jgstebbins(AT)comcast.net), Sep 17 2008

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 December 6 13:45 EST 2009. Contains 170429 sequences.


AT&T Labs Research