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!)
A104406 Number of numbers <= n having no 2 in ternary representation. 4

%I #9 Apr 29 2023 22:51:30

%S 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,

%T 11,11,11,12,13,13,14,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,

%U 15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15

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

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

%H N. J. A. Sloane, <a href="/A104406/b104406.txt">Table of n, a(n) for n = 1..10000</a>

%Y Cf. A005836, A004642, A039966.

%Y This is a lower bound for A003002.

%K nonn

%O 1,3

%A _Reinhard Zumkeller_, Mar 05 2005

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 April 23 07:11 EDT 2024. Contains 371905 sequences. (Running on oeis4.)