Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A134163
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A134163 a(n) = 1 + 12n + 81n^3 + n(105n+ 81n^3)/2. +0
1
1, 187, 1531, 5977, 16441, 36811, 71947, 127681, 210817, 329131, 491371, 707257, 987481, 1343707, 1788571, 2335681, 2999617, 3795931, 4741147, 5852761, 7149241, 8650027, 10375531, 12347137, 14587201, 17119051, 19966987, 23156281, 26713177 (list; graph; listen)
OFFSET

0,2

COMMENT

A000541(n) is divisible by A000537(n) if and only n is congruent to 1 mod 3 (see A016777)

FORMULA

a(n) = (3(3n + 1)^4 + 6(3n + 1)^3 - (3n + 1)^2 - 4 (3n + 1) + 2)/6 a(n) = Sum[k^7]/Sum[k^3], {k, 1, 3n + 1}

G.f.: -(1+182*x+606*x^2+182*x^3+x^4)/(-1+x)^5. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Nov 14 2007

MATHEMATICA

1) Table[(3(3n + 1)^4 + 6(3n + 1)^3 - (3n + 1)^2 - 4 (3n + 1) + 2)/6, {n, 0, 100}] 2) Table[Sum[k^7, {k, 1, 3n + 1}]/Sum[k^3, {k, 1, 3n + 1}], {n, 0, 100}] (*Artur Jasinski*)

CROSSREFS

Cf. A000537, A000541, A119617, A134153, A134154, A133180, A134158, A134159, A134160.

Sequence in context: A029556 A045224 A063346 this_sequence A030536 A143661 A070257

Adjacent sequences: A134160 A134161 A134162 this_sequence A134164 A134165 A134166

KEYWORD

nonn

AUTHOR

Artur Jasinski (grafix(AT)csl.pl), Oct 10 2007

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 December 4 21:35 EST 2008. Contains 151309 sequences.


AT&T Labs Research