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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A033051 Numbers whose set of base 15 digits is {0,1}. 5
 0, 1, 15, 16, 225, 226, 240, 241, 3375, 3376, 3390, 3391, 3600, 3601, 3615, 3616, 50625, 50626, 50640, 50641, 50850, 50851, 50865, 50866, 54000, 54001, 54015, 54016, 54225, 54226, 54240, 54241, 759375, 759376, 759390, 759391, 759600 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS Sums of distinct powers of 15. a(n) modulo 2 is the Prouhet-Thue-Morse sequence A010060. - Philippe Deléham, Oct 17 2011. LINKS T. D. Noe, Table of n, a(n) for n = 0..1023 FORMULA a(n) = Sum{d(i)*15^i: i=0, 1, ..., m}, where Sum{d(i)*2^i: i=0, 1, ..., m} is the base 2 representation of n. a(n) = A097261(n)/14. a(2n) = 15*a(n), a(2n+1) = a(2n)+1. a(n) = Sum_k>=0 {A030308(n,k)*15^k}. - Philippe Deléham, Oct 17 2011. G.f.: (1/(1 - x))*Sum_{k>=0} 15^k*x^(2^k)/(1 + x^(2^k)). - Ilya Gutkovskiy, Jun 04 2017 PROG (PARI) A033051(n, b=15)=subst(Pol(binary(n)), 'x, b) \\ M. F. Hasler, Feb 01 2016 CROSSREFS Cf. A000695, A005836, A033042-A033052. Row 14 of array A104257. Sequence in context: A041470 A041472 A041474 * A041111 A041476 A041477 Adjacent sequences:  A033048 A033049 A033050 * A033052 A033053 A033054 KEYWORD nonn,base,easy AUTHOR EXTENSIONS Extended by Ray Chandler, Aug 03 2004 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 March 30 19:49 EDT 2020. Contains 333127 sequences. (Running on oeis4.)