login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A136680 Triangular sequence made using; t(n,m)= a(n)=a(n - 1) + m^(n - 2)*a(n - 2); (*q - Fibonacci numbers : A015459 - A015485*). 0
1, 1, 1, 1, 1, 4, 1, 1, 4, 20, 1, 1, 4, 20, 520, 1, 1, 4, 20, 520, 26440, 1, 1, 4, 20, 520, 26440, 8766080, 1, 1, 4, 20, 520, 26440, 8766080, 6939853440, 1, 1, 4, 20, 520, 26440, 8766080, 6939853440, 41934828744960, 1, 1, 4, 20, 520, 26440, 8766080 (list; table; graph; refs; listen; history; internal format)
OFFSET

1,6

COMMENTS

Row sums are:

1, 2, 6, 26, 546, 26986, 8793066, 6948646506, 41941777391466, 694069220606136426

FORMULA

a(0)=0;a(1)=1; t(n,m)= a(n)=a(n - 1) + m^(n - 2)*a(n - 2);

EXAMPLE

{1},

{1, 1},

{1, 1, 4},

{1, 1, 4, 20},

{1, 1, 4, 20, 520},

{1, 1, 4, 20, 520, 26440},

{1, 1, 4, 20, 520, 26440, 8766080},

{1, 1, 4, 20, 520, 26440, 8766080, 6939853440},

{1, 1, 4, 20, 520, 26440, 8766080, 6939853440, 41934828744960},

{1, 1, 4, 20, 520, 26440, 8766080, 6939853440, 41934828744960, 694027278828744960}

MATHEMATICA

Clear[a, aa, n, m] a[0] = 0; a[1] = 1; a[n_] := a[n] = a[n - 1] + m^(n - 2)*a[n - 2]; aa = Table[Table[a[n], {n, 1, m}], {m, 1, 10}]; Flatten[aa]

CROSSREFS

Cf. q - Fibonacci numbers : A015459 - A015485.

Sequence in context: A133826 A122185 A193752 * A035589 A021247 A016522

Adjacent sequences:  A136677 A136678 A136679 * A136681 A136682 A136683

KEYWORD

nonn,uned,tabl

AUTHOR

Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Apr 06 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 10:05 EST 2012. Contains 206009 sequences.