login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A230866 Number of integers m such that m + (sum of digits in base-5 representation of m) = 2n. 2
1, 1, 1, 2, 2, 1, 2, 2, 1, 2, 2, 1, 2, 3, 2, 2, 3, 2, 1, 2, 2, 1, 2, 2, 1, 2, 3, 2, 2, 3, 2, 1, 2, 2, 1, 2, 2, 1, 2, 3, 2, 2, 3, 2, 1, 2, 2, 1, 2, 2, 1, 2, 3, 2, 2, 3, 2, 1, 2, 2, 1, 2, 2, 2, 3, 3, 3, 3, 2, 2, 2, 1, 2, 2, 1, 2, 3, 2, 2, 3, 2, 1, 2, 2, 1, 2, 2, 1, 2, 3, 2, 2, 3, 2, 1, 2, 2, 1, 2, 2, 1, 2, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

LINKS

Donovan Johnson, Table of n, a(n) for n = 0..10000

CROSSREFS

Cf. A230865, A230643.

Sequence in context: A306211 A131714 A130196 * A158209 A234538 A119646

Adjacent sequences:  A230863 A230864 A230865 * A230867 A230868 A230869

KEYWORD

nonn,base

AUTHOR

N. J. A. Sloane, Nov 05 2013

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 28 11:05 EDT 2021. Contains 346326 sequences. (Running on oeis4.)