Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A068665
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A068665 a(1) = 3; a(n) = smallest palindromic multiple of a(n-1). +0
10
3, 6, 66, 858, 6006, 66066, 858858, 222444222, 444888444, 21354645312, 21375999957312, 211643775577346112, 211432343445544343234112, 21354666687999978666645312, 211432554877887788778455234112 (list; graph; listen)
OFFSET

1,1

MATHEMATICA

a[1] = 3; 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, 16}]

CROSSREFS

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

Sequence in context: A069077 A076551 A127637 this_sequence A050722 A069502 A023174

Adjacent sequences: A068662 A068663 A068664 this_sequence A068666 A068667 A068668

KEYWORD

base,nonn

AUTHOR

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

EXTENSIONS

More terms from David W. Wilson (davidwwilson(AT)comcast.net); edited by 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 September 6 16:04 EDT 2008. Contains 143483 sequences.


AT&T Labs Research