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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A074507 a(n) = 1^n + 3^n + 5^n. 4
3, 9, 35, 153, 707, 3369, 16355, 80313, 397187, 1972809, 9824675, 49005273, 244672067, 1222297449, 6108298595, 30531927033, 152630937347, 763068593289, 3815084686115, 19074648589593, 95370918425027, 476847618556329 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

LINKS

Table of n, a(n) for n=0..21.

T. A. Guilliver, Divisibility of sums of powers of odd integers, Int. Math. For. 5 (2010) 3059-3066, eq. (6)

D. Suprijanto, I. W. Suwarno, Observation on Sums of Powers of Integers Divisible by 3k-1, Applied Mathematical Sciences, Vol. 8, 2014, no. 45, 2211 - 2217.

Index entries for linear recurrences with constant coefficients, signature (9,-23,15).

FORMULA

a(n) = 8*a(n-1) - 15*a(n-2) + 8.

G.f.: 1/(1-x)+1/(1-3*x)+1/(1-5*x). E.g.f.: e^x+e^(3*x)+e^(5*x). [Mohammad K. Azarian, Dec 26 2008]

MATHEMATICA

Table[1^n + 3^n + 5^n, {n, 0, 22}]

PROG

(PARI) a(n) = 1 + 3^n + 5^n; \\ Michel Marcus, Aug 07 2017

CROSSREFS

Cf. A001550, A001576, A034513, A001579, A074501-A074580.

Sequence in context: A151045 A225041 A327885 * A217924 A030268 A097277

Adjacent sequences:  A074504 A074505 A074506 * A074508 A074509 A074510

KEYWORD

easy,nonn

AUTHOR

Robert G. Wilson v, Aug 23 2002

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 October 21 22:47 EDT 2019. Contains 328315 sequences. (Running on oeis4.)