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!)
A230643 Number of integers m such that m + (sum of digits in base-3 representation of m) = 2n. 13
1, 1, 2, 1, 2, 2, 2, 2, 1, 2, 2, 2, 2, 1, 3, 2, 3, 1, 2, 2, 2, 2, 1, 2, 2, 2, 2, 1, 3, 2, 3, 1, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 3, 3, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 1, 3, 2, 3, 1, 2, 2, 2, 2, 1, 2, 2, 2, 2, 1, 3, 2, 3, 1, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 3, 3, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 1, 3, 2, 3, 1, 2, 2, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
Number of times 2n appears in A230641.
LINKS
CROSSREFS
Related base-3 sequences: A053735, A134451, A230641, A230642, A230643, A230853, A230854, A230855, A230856, A230639, A230640, A010063 (trajectory of 1)
Sequence in context: A043531 A297772 A043556 * A344117 A163367 A057226
KEYWORD
nonn,base
AUTHOR
N. J. A. Sloane, Oct 31 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 18 22:50 EDT 2024. Contains 370951 sequences. (Running on oeis4.)