Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A136680
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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, 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; listen)
OFFSET

1,6

COMMENT

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: A001638 A133826 A122185 this_sequence A035589 A021247 A016522

Adjacent sequences: A136677 A136678 A136679 this_sequence A136681 A136682 A136683

KEYWORD

nonn,uned,tabl

AUTHOR

Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Apr 06 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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research