This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A230642 Number of integers m such that m + (sum of digits in base-3 representation of m) = n. 12
 1, 0, 1, 0, 2, 0, 1, 0, 2, 0, 2, 0, 2, 0, 2, 0, 1, 0, 2, 0, 2, 0, 2, 0, 2, 0, 1, 0, 3, 0, 2, 0, 3, 0, 1, 0, 2, 0, 2, 0, 2, 0, 2, 0, 1, 0, 2, 0, 2, 0, 2, 0, 2, 0, 1, 0, 3, 0, 2, 0, 3, 0, 1, 0, 2, 0, 2, 0, 2, 0, 2, 0, 1, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 3, 0, 3, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 1, 0, 2, 0, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 COMMENTS The usual convention in the OEIS is to omit the zero terms when every second term is zero. An exception was made in this case in order to preserve the parallels with A228085 and A230632. See also A230663. a(n) is the number of times n occurs in A230641. LINKS Donovan Johnson, Table of n, a(n) for n = 0..10000 CROSSREFS Cf. A230632, A228085, A230643, A230641. Related base-3 sequences: A053735, A134451, A230641, A230642, A230643, A230853, A230854, A230855, A230856, A230639, A230640, A010063 (trajectory of 1) Sequence in context: A091394 A029881 A070090 * A053473 A322983 A208459 Adjacent sequences:  A230639 A230640 A230641 * A230643 A230644 A230645 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 14 14:20 EST 2019. Contains 329979 sequences. (Running on oeis4.)