Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A062932
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A062932 a(1) = 1; a(n) = smallest number > a(n-1) such that a(n-1)+a(n) is a palindrome. +0
1
1, 2, 3, 4, 5, 6, 16, 17, 27, 28, 38, 39, 49, 50, 51, 60, 61, 70, 71, 80, 81, 90, 91, 100, 102, 110, 112, 120, 122, 130, 132, 140, 142, 150, 153, 160, 163, 170, 173, 180, 183, 190, 193, 200, 204, 210, 214, 220, 224, 230, 234, 240, 244, 250, 255, 260, 265, 270 (list; graph; listen)
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 3 22:15 EST 2009. Contains 170310 sequences.


AT&T Labs Research