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!)
A264687 a(n) = 2^n - A006951(n). 3

%I #7 May 06 2018 04:44:09

%S 0,1,1,2,2,5,4,11,10,22,22,50,43,104,100,209,206,446,418,914,886,1838,

%T 1825,3800,3664,7696,7591,15470,15370,31466,30910,63398,62866,127154,

%U 126742,256559,254156,515168,513004,1032104,1029997,2073626,2063866,4156118

%N a(n) = 2^n - A006951(n).

%H Vaclav Kotesovec, <a href="/A264687/b264687.txt">Table of n, a(n) for n = 0..1000</a>

%F a(n) ~ (1+sqrt(2) + (-1)^n*(1-sqrt(2))) * 2^(n/2 - 1).

%t nmax = 60; 2^Range[0, nmax] - CoefficientList[Series[Product[(1 - x^k)/(1 - 2*x^k), {k, 1, nmax}], {x, 0, nmax}], x]

%Y Cf. A006951, A304082.

%K nonn

%O 0,4

%A _Vaclav Kotesovec_, Nov 21 2015

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 18:04 EDT 2024. Contains 371254 sequences. (Running on oeis4.)