Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A152036
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A152036 Triangular product sequence based 2^n times the Fibonacci version and 4 replaced with m: t(m,n)=2^n*Product[(1 + m*Cos[k*Pi/n]^2), {k, 1, Floor[(n - 1)/2]}]. +0
1
1, 1, 2, 1, 2, 4, 1, 2, 4, 14, 1, 2, 4, 16, 48, 1, 2, 4, 18, 56, 202, 1, 2, 4, 20, 64, 248, 880, 1, 2, 4, 22, 72, 298, 1100, 4286, 1, 2, 4, 24, 80, 352, 1344, 5504, 21760, 1, 2, 4, 26, 88, 410, 1612, 6914, 28336, 118898, 1, 2, 4, 28, 96, 472, 1904, 8528, 36096, 157472 (list; table; graph; listen)
OFFSET

0,3

COMMENT

The row sums are: {1, 3, 7, 21, 71, 283, 1219, 5785, 29071, 156291, 880507,...}. A sequence of sequences with the row numbers m instead of n: and the ratio increases with each row: at (1+Sqrt[5]) for m=4.

FORMULA

t(m,n)=2^n*Product[(1 + m*Cos[k*Pi/n]^2), {k, 1, Floor[(n - 1)/2]}].

EXAMPLE

{1}, {1, 2}, {1, 2, 4}, {1, 2, 4, 14}, {1, 2, 4, 16, 48}, {1, 2, 4, 18, 56, 202}, {1, 2, 4, 20, 64, 248, 880}, {1, 2, 4, 22, 72, 298, 1100, 4286}, {1, 2, 4, 24, 80, 352, 1344, 5504, 21760}, {1, 2, 4, 26, 88, 410, 1612, 6914, 28336, 118898}, {1, 2, 4, 28, 96, 472, 1904, 8528, 36096, 157472, 675904}

MATHEMATICA

f[n_, m_] = 2^n*Product[(1 + m*Cos[k*Pi/n]^2), {k, 1, Floor[(n - 1)/2]}]; Table[Table[FullSimplify[ExpandAll[f[n, m]]], {n, 0, m}], {m, 0, 10}]

CROSSREFS

Sequence in context: A123937 A138882 A074634 this_sequence A035015 A114791 A129994

Adjacent sequences: A152033 A152034 A152035 this_sequence A152037 A152038 A152039

KEYWORD

nonn,uned,tabl

AUTHOR

Roger L. Bagula and Gary W. Adamson (rlbagulatftn(AT)yahoo.com), Nov 20 2008

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research