Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A153491
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A153491 A binomial based triangular sequence: t(n,m)=If[n == 1, 3, If[m == 0 || m == n, 2, 11*Binomial[n, k] - 8]]. +0
1
2, 3, 3, 2, 14, 2, 2, 25, 25, 2, 2, 36, 58, 36, 2, 2, 47, 102, 102, 47, 2, 2, 58, 157, 212, 157, 58, 2, 2, 69, 223, 377, 377, 223, 69, 2, 2, 80, 300, 608, 762, 608, 300, 80, 2, 2, 91, 388, 916, 1378, 1378, 916, 388, 91, 2, 2, 102, 487, 1312, 2302, 2764, 2302, 1312, 487, 102 (list; table; graph; listen)
OFFSET

0,1

COMMENT

Row sums are:

{2, 6, 18, 54, 134, 302, 646, 1342, 2742, 5550, 11174,...}

FORMULA

t(n,m)=If[n == 1, 3, If[m == 0 || m == n, 2, 11*Binomial[n, k] - 8]].

EXAMPLE

{2},

{3, 3},

{2, 14, 2},

{2, 25, 25, 2},

{2, 36, 58, 36, 2},

{2, 47, 102, 102, 47, 2},

{2, 58, 157, 212, 157, 58, 2},

{2, 69, 223, 377, 377, 223, 69, 2},

{2, 80, 300, 608, 762, 608, 300, 80, 2},

{2, 91, 388, 916, 1378, 1378, 916, 388, 91, 2},

{2, 102, 487, 1312, 2302, 2764, 2302, 1312, 487, 102, 2}

MATHEMATICA

Clear[t];

t[n_, m_] = If[n == 1, 3, If[m == 0 || m == n, 2, 11*Binomial[n, k] - 8]]

a1 = Table[Table[t[n, k], {k, 0, n}], {n, 0, 10}];

Flatten[a1]

CROSSREFS

A131065

Sequence in context: A023139 A153290 A153516 this_sequence A153311 A153312 A153283

Adjacent sequences: A153488 A153489 A153490 this_sequence A153492 A153493 A153494

KEYWORD

nonn,uned,tabl

AUTHOR

Roger L. Bagula and Gary W. Adamson (rlbagulatftn(AT)yahoo.com), Dec 27 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 | The OEIS Foundation | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified March 19 13:18 EDT 2010. Contains 173632 sequences.


AT&T Labs Research