|
Search: id:A005167
|
|
|
| A005167 |
|
a(n+1) = (1 + a(0)^4 + ... + a(n)^4 )/(n+1) (not always integral!).
(Formerly M1957)
|
|
+0
5
|
|
| 1, 2, 9, 2193, 5782218987645, 223567225753623833253893162919867828939456664850241
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Guy states that by computing the sequence modulo 97 it is easy to show that a(97) is not integral. - T. D. Noe, Sep 17 2007
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
R. K. Guy, The strong law of small numbers. Amer. Math. Monthly 95 (1988), no. 8, 697-712.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=0..7
N. Lygeros & M. Mizony, Study of primality of terms of a_k(n)=(1+(sum from 1 to n-1)(a_k(i)^k))/(n-1)
|
|
CROSSREFS
|
Cf. A005166, A003504.
Cf. A108394
Sequence in context: A067691 A062840 A024226 this_sequence A067039 A027734 A028581
Adjacent sequences: A005164 A005165 A005166 this_sequence A005168 A005169 A005170
|
|
KEYWORD
|
easy,nonn,nice
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
