Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A069510
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A069510 a(1) = 1; a(n) = smallest palindrome of the form k*a(n-1) + 1. +0
6
1, 2, 3, 4, 5, 6, 7, 8, 9, 55, 111, 1111, 11111, 111111, 1111111, 11111111, 111111111, 1111111111, 11111111111, 111111111111, 1111111111111, 11111111111111, 111111111111111, 1111111111111111, 11111111111111111, 111111111111111111 (list; graph; listen)
OFFSET

1,2

FORMULA

a(n) = {10^(n - 8) - 1}/9 for n >10.

MATHEMATICA

a[1] = 1; a[n_] := a[n] = Block[{k = 1}, While[ FromDigits[ Reverse[ IntegerDigits[ k*a[n - 1] + 1]]] != k*a[n - 1] + 1, k++ ]; k*a[n - 1] + 1]; Table[ a[n], {n, 1, 26}]

CROSSREFS

Cf. A069505, A069506, A069507, A069508, A069509.

Sequence in context: A122627 A122629 A083477 this_sequence A062388 A070244 A102493

Adjacent sequences: A069507 A069508 A069509 this_sequence A069511 A069512 A069513

KEYWORD

nonn,base

AUTHOR

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

EXTENSIONS

Edited and extended by Robert G. Wilson v (rgwv(AT)rgwv.com), Apr 19 2003

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 July 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research