login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A341192 Number of ways to write n as an ordered sum of 3 nonzero decimal palindromes. 9
1, 3, 6, 10, 15, 21, 28, 36, 45, 52, 60, 66, 70, 72, 72, 70, 66, 60, 55, 45, 39, 34, 30, 27, 25, 24, 24, 24, 27, 27, 25, 27, 27, 27, 27, 27, 27, 27, 27, 30, 27, 27, 30, 30, 30, 30, 30, 30, 30, 30, 33, 27, 30, 33, 33, 33, 33, 33, 33, 33, 33, 36, 27, 34, 36, 36, 36, 36 (list; graph; refs; listen; history; text; internal format)
OFFSET
3,2
LINKS
MATHEMATICA
nmax = 70; CoefficientList[Series[Sum[Boole[PalindromeQ[k]] x^k, {k, 1, nmax}]^3, {x, 0, nmax}], x] // Drop[#, 3] &
CROSSREFS
Sequence in context: A037123 A062918 A113168 * A071817 A033442 A105335
KEYWORD
nonn,base
AUTHOR
Ilya Gutkovskiy, Feb 06 2021
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 10 08:52 EDT 2024. Contains 372373 sequences. (Running on oeis4.)