Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A109859
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A109859 Number of terms of A109858 with digit sum n. +0
2
1, 2, 2, 6, 6, 20, 20, 70, 70, 251, 251, 918, 917, 3404, 3396, 12750, 12705, 48125, 47905, 182735, 181743, 697193, 692924, 2670538, 2652676, 10263255, 10189830, 39554920, 39256570, 152819066, 151616215, 591672286, 586848959, 2295096732 (list; graph; listen)
OFFSET

0,2

COMMENT

Can some one find a formula for the n-th term?

At first a(2n) = a(2n+1) because the palindromes of sum 2n can be placed into one-to-one correpsondence with the palindromes of sum 2n+1 by inserting a 1 in the middle (if the number of digits is even) or adding one to the middle digit (if the number of digits is odd). However once there exists a palindrome with middle digit 9, this strategy no longer works. - Joshua Zucker (joshua.zucker(AT)stanfordalumni.org), May 05 2006

CROSSREFS

Cf. A109858.

Sequence in context: A117855 A086442 A071407 this_sequence A128057 A128014 A135401

Adjacent sequences: A109856 A109857 A109858 this_sequence A109860 A109861 A109862

KEYWORD

base,hard,nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jul 08 2005

EXTENSIONS

More terms from Joshua Zucker (joshua.zucker(AT)stanfordalumni.org), May 05 2006

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 13 23:45 EST 2009. Contains 170824 sequences.


AT&T Labs Research