Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A134159
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A134159 a(n) = 13 + 165 n + 756 n^2 + 1470 n^3 + 1029 n^4. +0
7
13, 3433, 31591, 130351, 370273, 846613, 1679323, 3013051, 5017141, 7885633, 11837263, 17115463, 23988361, 32748781, 43714243, 57226963, 73653853, 93386521, 116841271, 144459103, 176705713, 214071493, 257071531, 306245611 (list; graph; listen)
OFFSET

0,1

COMMENT

A000540(n) is divisible by A000330(n) if and only n is congruent to {1,2,4,5} mod 7 (see A047380) A134158 is case when n is congruent to 1 mod 7 A134159 is case when n is congruent to 2 mod 7 A134160 is case when n is congruent to 4 mod 7 A134161 is case when n is congruent to 5 mod 7 A133180 is union of A134158 and A134159 and A134160 and A134161

FORMULA

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

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

MATHEMATICA

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

CROSSREFS

Cf. A000330, A000540, A119617, A134153, A134154, A133180, A134158, A134160, A134161.

Sequence in context: A145187 A141077 A096721 this_sequence A070905 A068532 A094316

Adjacent sequences: A134156 A134157 A134158 this_sequence A134160 A134161 A134162

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