Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A134160
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A134160 a(n) = 163 + 1053n + 2520n^2 + 2646n^3 + 1029n^4. +0
7
163, 7411, 49981, 180793, 477463, 1042303, 2002321, 3509221, 5739403, 8893963, 13198693, 18904081, 26285311, 35642263, 47299513, 61606333, 78936691, 99689251, 124287373, 153179113, 186837223, 225759151, 270467041, 321507733 (list; graph; listen)
OFFSET

0,1

COMMENT

A000540(n) is divisable 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 + 4)^4 + 6(7n + 4)^3 - 3 (7n + 4) + 1)/7 a(n) = Sum[k^6]/Sum[k^2], {k, 1, 7n + 4}]

MATHEMATICA

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

CROSSREFS

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

Sequence in context: A002149 A109343 A027543 this_sequence A049498 A138932 A138200

Adjacent sequences: A134157 A134158 A134159 this_sequence A134161 A134162 A134163

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 July 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research