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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A134007 a(n) = 1^n + 3^n + 5^n + 7^n + 9^n. 3
5, 25, 165, 1225, 9669, 79225, 665445, 5686825, 49208709, 429746905, 3779084325, 33407391625, 296515495749, 2639977136185, 23561123826405, 210669225531625, 1886405750358789, 16910575282247065, 151726863979595685 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
LINKS
T. A. Gulliver, Divisibility of sums of powers of odd integers, Int. Math. For. 5 (2010) 3059-3066, eq. 6.
FORMULA
a(n) = 24*a(n-1) - 206*a(n-2) + 744*a(n-3) - 945*a(n-4) + 384.
G.f.: -(5 - 100*x + 690*x^2 - 1900*x^3 + 1689*x^4)/((-1+x)*(3*x-1)*(9*x-1)*(7*x-1)*(5*x-1)). - R. J. Mathar, Nov 14 2007
a(n) = A134006(n) + A001019(n). - Michel Marcus, Nov 07 2013
EXAMPLE
a(3)=165 because 1^2 + 3^2 + 5^2 + 7^2 + 9^2 = 165.
MATHEMATICA
Table[1^n+3^n+5^n+7^n+9^n, {n, 0, 30}]
PROG
(Magma) [1^n + 3^n + 5^n + 7^n + 9^n: n in [0..20]]; // Vincenzo Librandi, Jun 20 2011
CROSSREFS
Sequence in context: A181344 A361916 A356596 * A125794 A109793 A112242
KEYWORD
nonn,easy
AUTHOR
Artur Jasinski, Oct 01 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 March 28 10:55 EDT 2024. Contains 371241 sequences. (Running on oeis4.)