Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

0,2

FORMULA

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

G.f.=(110*x^5-61*x^4-25*x^3-16*x^2-8*x+1)/(10*x-1)/(x-1) - Maksym Voznyy (voznyy(AT)mail.ru), Jan 10 2008

MAPLE

A069505:=seriestolist(taylor((1+110*x^5-61*x^4-25*x^3-16*x^2-8*x)/(10*x-1)/(x-1), x, 20)); - Maksym Voznyy (voznyy(AT)mail.ru), Jan 10 2008

CROSSREFS

Cf. A069506, A069507, A069508, A069509, A069510.

Sequence in context: A108070 A038147 A082271 this_sequence A032403 A072584 A139513

Adjacent sequences: A069502 A069503 A069504 this_sequence A069506 A069507 A069508

KEYWORD

nonn,base

AUTHOR

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

EXTENSIONS

More terms from Patrick De Geest (pdg(AT)worldofnumbers.com), Jun 11 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 6 17:22 EDT 2008. Contains 140988 sequences.


AT&T Labs Research