login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A100532 The first four numbers of this sequence are the primes 2,3,5,7. The other terms are calculated by adding the previous four terms. 6
2, 3, 5, 7, 17, 32, 61, 117, 227, 437, 842, 1623, 3129, 6031, 11625, 22408, 43193, 83257, 160483, 309341, 596274, 1149355, 2215453, 4270423, 8231505, 15866736, 30584117, 58952781, 113635139, 219038773, 422210810, 813837503, 1568722225, 3023809311, 5828579849 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

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

Martin Burtscher, Igor Szczyrba, RafaƂ Szczyrba, Analytic Representations of the n-anacci Constants and Generalizations Thereof, Journal of Integer Sequences, Vol. 18 (2015), Article 15.4.5.

Index entries for linear recurrences with constant coefficients, signature (1,1,1,1)

FORMULA

a(n) = a(n-1) + a(n-2) + a(n-3) + a(n-4) where n >= 5 and a(1)=2, a(2)=3, a(3) = 5 and a(4) = 7.

G.f.:  x*(x-1)*(3*x^2+3*x+2) / ( -1+x+x^2+x^3+x^4 ). - R. J. Mathar, Feb 03 2011

EXAMPLE

The fifth term is 2+3+5+7 = 17.

PROG

(PARI) a(n)=([0, 1, 0, 0; 0, 0, 1, 0; 0, 0, 0, 1; 1, 1, 1, 1]^(n-1)*[2; 3; 5; 7])[1, 1] \\ Charles R Greathouse IV, Nov 01 2018

CROSSREFS

Sequence in context: A143027 A001153 A141453 * A231480 A040149 A168034

Adjacent sequences:  A100529 A100530 A100531 * A100533 A100534 A100535

KEYWORD

easy,nonn

AUTHOR

Parthasarathy Nambi, Nov 24 2004

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 17 16:32 EDT 2021. Contains 347487 sequences. (Running on oeis4.)