OFFSET
0,3
COMMENTS
Sums of distinct powers of 14.
The base-14 digits may comprise zero, one, or both. - Harvey P. Dale, May 12 2014
LINKS
T. D. Noe, Table of n, a(n) for n = 0..1023
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_{i=0..m} d(i)*14^i, where Sum_{i=0..m} d(i)*2^i is the base-2 representation of n.
a(n) = A097260(n)/13.
a(2n) = 14*a(n), a(2n+1) = a(2n)+1.
a(n) = Sum_{k>=0} A030308(n,k)*14^k. - Philippe Deléham, Oct 20 2011
G.f.: (1/(1 - x))*Sum_{k>=0} 14^k*x^(2^k)/(1 + x^(2^k)). - Ilya Gutkovskiy, Jun 04 2017
MATHEMATICA
Select[Range[0, 540000], Max[IntegerDigits[#, 14]]<2&] (* Harvey P. Dale, May 12 2014 *)
FromDigits[#, 14]&/@Tuples[{0, 1}, 6] (* Harvey P. Dale, Jun 18 2021 *)
PROG
(PARI) A033050(n, b=14)=subst(Pol(binary(n)), 'x, b) \\ M. F. Hasler, Feb 01 2016
CROSSREFS
KEYWORD
nonn,base
AUTHOR
EXTENSIONS
Extended by Ray Chandler, Aug 03 2004
STATUS
approved