Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A139545
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A139545 Binomial transform of [1, 0, 0, 4, 0, 0, 7, 0, 0, 10,...]. +0
1
1, 1, 1, 5, 17, 41, 88, 190, 421, 935, 2051, 4445, 9562, 20476, 43681, 92837, 196613, 415073, 873820, 1835002, 3844765, 8039075, 16777223, 34952549, 72701278, 150994936, 313174681, 648719009, 1342177289, 2773833065, 5726623072 (list; graph; listen)
OFFSET

1,4

FORMULA

A007318 * [1, 0, 0, 4, 0, 0, 7, 0, 0, 10,...].

a(n)=Sum((3k+1)binom(n,3k), k=0..n/3) - Emeric Deutsch (deutsch(AT)duke.poly.edu), May 03 2008

EXAMPLE

a(4) = 5 = (1, 3, 3, 1) dot (1, 0, 0, 4) = (1 + 0 + 0 + 4).

MAPLE

a:=proc(n) options operator, arrow: sum((3*k+1)*binomial(n, 3*k), k=0..(1/3)*n) end proc: seq(a(n), n=0..30); - Emeric Deutsch (deutsch(AT)duke.poly.edu), May 03 2008

CROSSREFS

Adjacent sequences: A139542 A139543 A139544 this_sequence A139546 A139547 A139548

Sequence in context: A109722 A097121 A007904 this_sequence A106972 A086499 A097123

KEYWORD

nonn

AUTHOR

Gary W. Adamson (qntmpkt(AT)yahoo.com), Apr 26 2008

EXTENSIONS

More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), May 03 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 October 7 14:39 EDT 2008. Contains 144666 sequences.


AT&T Labs Research