OFFSET
0,3
COMMENTS
Numbers whose set of base 17 digits is {0,1}.
Sums of distinct powers of 17.
a(n) modulo 2 is the Prouhet-Thue-Morse sequence A010060. - Philippe Deléham, Oct 17 2011.
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Hsien-Kuei Hwang, Svante Janson, and Tsung-Hsi Tsai, Identities and periodic oscillations of divide-and-conquer recurrences splitting at half, arXiv:2210.10968 [cs.DS], 2022, p. 45.
FORMULA
a(n)=Sum_k>=0 {A030308(n,k)*17^k}.
G.f.: (1/(1 - x))*Sum_{k>=0} 17^k*x^(2^k)/(1 + x^(2^k)). - Ilya Gutkovskiy, Jun 04 2017
MATHEMATICA
Take[Union[Total/@Subsets[17^Range[0, 20], 5]], 40] (* Harvey P. Dale, Dec 17 2011 *)
FromDigits[#, 17]&/@Tuples[{0, 1}, 5] (* Vincenzo Librandi, Jun 05 2012 *)
PROG
(Magma) [n: n in [0..1500000] | Set(IntegerToSequence(n, 17)) subset {0, 1}]; // Vincenzo Librandi, Jun 05 2012
CROSSREFS
KEYWORD
easy,nonn,base
AUTHOR
Philippe Deléham, Oct 14 2011
STATUS
approved