Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A068910
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A068910 a(n) is the unique k such that palindrome A068065(n) = k + reverse(k). +0
1
0, 1, 2, 3, 4, 10, 100, 120, 130, 140, 1000, 10000, 10100, 10200, 10300, 10400, 100000, 1000000, 1001000, 1002000, 1003000, 1004000, 10000000, 100000000, 100010000, 100020000, 100030000, 100040000, 1000000000, 10000000000 (list; graph; listen)
OFFSET

0,3

EXAMPLE

a(14) = 10300, since A068065(14) = 10601 = 10300 + 00301 and for no other k we have 10601 = k + reverse(k).

CROSSREFS

Cf. A068065.

Sequence in context: A139009 A049204 A045924 this_sequence A146027 A035358 A065633

Adjacent sequences: A068907 A068908 A068909 this_sequence A068911 A068912 A068913

KEYWORD

base,nonn

AUTHOR

Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Mar 05 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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research