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!)
A152046 a(n) = Product_{k=1..floor((n-1)/2)} (1 + 8*cos(k*Pi/n)^2) for n >= 0. 6
1, 1, 1, 3, 5, 11, 21, 43, 85, 171, 341, 683, 1365, 2731, 5461, 10923, 21845, 43691, 87381, 174763, 349525, 699051, 1398101, 2796203, 5592405, 11184811, 22369621, 44739243, 89478485, 178956971, 357913941, 715827883, 1431655765, 2863311531, 5726623061, 11453246123 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
COMMENTS
Apparently the same as A001045 after the first term. - R. J. Mathar, Nov 27 2008 [This conjecture is true. - Peter Luschny, Nov 28 2019]
LINKS
FORMULA
From Sergei N. Gladkovskii, May 22 2013 and Sep 09 2013: (Start)
G.f.: 1 + A(x) where A(x) is the g.f. of A001045.
G.f.: 1 + Q(0)/3, where Q(k)= 1 - 1/(4^k - 2*x*16^k/(2*x*4^k - 1/(1 + 1/(2*4^k - 8*x*16^k/(4*x*4^k + 1/Q(k+1)))))); (continued fraction).
G.f.: 1+ Q(0)*x/2 , where Q(k) = 1 + 1/(1 - x*(2*k+1 + 2*x)/( x*(2*k+2 + 2*x) + 1/Q(k+1) )); (continued fraction). (End)
From Colin Barker, Nov 28 2019: (Start)
a(n) = a(n-1) + 2*a(n-2) for n>2.
a(n) = ((-1)^(1 + n) + 2^n)/ 3 for n>0. (End)
E.g.f.: (3 - exp(-x) + exp(2*x))/3. - Stefano Spezia, Feb 13 2020
MATHEMATICA
a[n_] := Product[(1 + 8 Cos[k Pi/n]^2), {k, 1, Floor[(n - 1)/2]}];
Table[Round[a[n]], {n, 0, 20}]
PROG
(PARI) Vec((1 - 2*x^2) / ((1 + x)*(1 - 2*x)) + O(x^40)) \\ Colin Barker, Nov 28 2019
(PARI) apply( {A152046(n)=2^n\/3+!n}, [0..40]) \\ M. F. Hasler, Feb 13 2020
CROSSREFS
Cf. A001045.
Sequence in context: A167167 A077925 A001045 * A283642 A284426 A284547
KEYWORD
nonn,easy
AUTHOR
Roger L. Bagula, Nov 21 2008
EXTENSIONS
Edited by Peter Luschny, Nov 28 2019
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 April 25 03:15 EDT 2024. Contains 371964 sequences. (Running on oeis4.)