login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A130671 Triangular sequence based on Pascal's triangle: t(n,m) = 2*binomial(m, n) - (1 + n*(m - n)). 0
1, 1, 1, 1, 2, 1, 1, 3, 3, 1, 1, 4, 7, 4, 1, 1, 5, 13, 13, 5, 1, 1, 6, 21, 30, 21, 6, 1, 1, 7, 31, 57, 57, 31, 7, 1, 1, 8, 43, 96, 123, 96, 43, 8, 1, 1, 9, 57, 149, 231, 231, 149, 57, 9, 1, 1, 10, 73, 218, 395, 478, 395, 218, 73, 10, 1 (list; table; graph; refs; listen; history; text; internal format)
OFFSET

1,5

COMMENTS

Suggested by Gary W. Adamson from a previous submission. Very close to (but slightly smaller at 7th row) A086617.

LINKS

Table of n, a(n) for n=1..66.

FORMULA

t(n,m) = 2*binomial[m, n] - (1 + n*(m - n)).

EXAMPLE

{1},

{1, 1},

{1, 2, 1},

{1, 3, 3, 1},

{1, 4, 7, 4, 1},

{1, 5, 13, 13, 5, 1},

{1, 6, 21, 30, 21, 6, 1},

{1, 7, 31, 57, 57, 31, 7, 1}

MATHEMATICA

Table[Table[2*Binomial[m, n] - (1 + n*(m - n)), {n, 0, m}], {m, 0, 10}] Flatten[%]

CROSSREFS

Cf. A086617.

Sequence in context: A173075 A166293 A094525 * A114197 A108350 A086617

Adjacent sequences: A130668 A130669 A130670 * A130672 A130673 A130674

KEYWORD

nonn,tabl

AUTHOR

Roger L. Bagula and Gary W. Adamson, Jun 27 2007

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 December 7 07:00 EST 2022. Contains 358649 sequences. (Running on oeis4.)