A104406 - OEIS

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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A104406

Number of numbers <= n having no 2 in ternary representation.

1, 1, 2, 3, 3, 3, 3, 3, 4, 5, 5, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 9, 9, 10, 11, 11, 11, 11, 11, 12, 13, 13, 14, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,3

COMMENTS

Partial sums of A039966: a(n) = Sum(A039966(k): 1<=k<=n).

LINKS

N. J. A. Sloane, Table of n, a(n) for n = 1..10000

CROSSREFS

Cf. A005836, A004642, A039966.

This is a lower bound for A003002.

Sequence in context: A131808 A196183 A200264 * A080344 A194225 A025782

Adjacent sequences: A104403 A104404 A104405 * A104407 A104408 A104409

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller, Mar 05 2005

STATUS

approved