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!)
A082388 a(1) = 1, a(2) = 2; further terms are defined by rules that for k >= 2, a(2^k-i) = a(2^k+i) for 1 <= i <= 2^k-1 and a(2^k) = a(2^(k-1)) + Sum_{i < 2^k} a(i). 2
1, 2, 1, 6, 1, 2, 1, 20, 1, 2, 1, 6, 1, 2, 1, 68, 1, 2, 1, 6, 1, 2, 1, 20, 1, 2, 1, 6, 1, 2, 1, 232, 1, 2, 1, 6, 1, 2, 1, 20, 1, 2, 1, 6, 1, 2, 1, 68, 1, 2, 1, 6, 1, 2, 1, 20, 1, 2, 1, 6, 1, 2, 1, 792, 1, 2, 1, 6, 1, 2, 1, 20, 1, 2, 1, 6, 1, 2, 1, 68, 1, 2, 1, 6, 1, 2, 1, 20, 1, 2, 1, 6, 1, 2, 1, 232, 1, 2, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(2^k) = 4*a(2^(k-1)) - 2*a(2^(k-2));
a(2^k) = round((1/2)*(2+sqrt(2))^k).
Multiplicative with a(2^e) = A006012(e), a(p^e) = 1 for odd prime p. - Andrew Howroyd, Jul 31 2018
MATHEMATICA
a[n_] := With[{e = IntegerExponent[n, 2]}, Sum[Binomial[e, 2k] 2^(e-k), {k, 0, Quotient[e, 2]}]];
a /@ Range[1, 100] (* Jean-François Alcover, Sep 20 2019, from PARI *)
PROG
(PARI) a(n)={my(e=valuation(n, 2)); sum(k=0, e\2, binomial(e, 2*k)*2^(e-k))} \\ Andrew Howroyd, Jul 31 2018
CROSSREFS
Cf. A006012.
Sequence in context: A345461 A229818 A324500 * A178254 A085099 A193807
KEYWORD
nonn,mult
AUTHOR
Benoit Cloitre, Apr 14 2003
STATUS
approved

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 March 28 11:59 EDT 2024. Contains 371254 sequences. (Running on oeis4.)