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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A113439 a(n) = a(n-1) + Sum_{0<k<=n/4} a(n-4k), with a(0)=1. 6
1, 1, 1, 1, 2, 3, 4, 5, 8, 12, 17, 23, 34, 50, 72, 101, 146, 212, 306, 436, 627, 905, 1305, 1871, 2689, 3872, 5577, 8014, 11521, 16576, 23858, 34309, 49337, 70968, 102108, 146868, 211233, 303832, 437080, 628708, 904306, 1300737, 1871065, 2691401 (list; graph; refs; listen; history; internal format)
OFFSET

0,5

COMMENTS

If presented in four rows a(4n), a(4n+1), a(4n+2) and a(4n+3) each term is the sum of the previous term in the sequence and the partial sum of its row.

FORMULA

a(n) = a(n-1)+2a(n-4)-a(n-5) = 9a(n-4)-28a(n-8)+38a(n-12)-20a(n-16)+a(n-20).

G.f.: (1-x^4)/(1-x-2x^4+x^5).

CROSSREFS

Cf. A113435, A113444, A028495.

Sequence in context: A059747 A094087 A017821 * A018059 A050024 A065490

Adjacent sequences:  A113436 A113437 A113438 * A113440 A113441 A113442

KEYWORD

nonn

AUTHOR

Floor van Lamoen (fvlamoen(AT)hotmail.com), Nov 04 2005

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 15 03:33 EST 2012. Contains 205694 sequences.