|
| |
|
|
A067686
|
|
a(n) = a(n-1) * a(n-1) - B * a(n-1) + B, a(0) = 1 + B for B = 7.
|
|
2
| |
|
|
8, 15, 127, 15247, 232364287, 53993160246468367, 2915261353400811631533974206368127, 8498748758632331927648392184620600167779995785955324343380396911247
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
COMMENTS
| This is the special case k=7 of sequences with exact mutual k-residues. In general, a(1)=k+1 and a(n)=min{m | m>a(n-1), mod(m,a(i))=k, i=1,...,n-1}. k=1 gives Sylvester's sequence A000058 and k=2 Fermat sequence A000215. - Seppo Mustonen (seppo.mustonen(AT)helsinki.fi), Sep 04 2005
|
|
|
REFERENCES
| S. W. Golomb, On certain nonlinear recurring sequences, Amer. Math. Monthly 70 (1963), 403-405.
|
|
|
LINKS
| A. V. Aho and N. J. A. Sloane, Some doubly exponential sequences, Fib. Quart., 11 (1973), 429-437.
Stanislav Drastich, Rapid growth sequences (2002).
S. Mustonen, On integer sequences with mutual k-residues
Index entries for sequences of form a(n+1)=a(n)^2 + ....
|
|
|
CROSSREFS
| Cf. B=1: A000058 (Sylvester's sequence), B=2: A000215 (Fermat numbers), B=3: A000289, B=4: A000324, B=5: A001543, B=6: A001544.
Sequence in context: A110294 A110459 A132374 * A145219 A002406 A153700
Adjacent sequences: A067683 A067684 A067685 * A067687 A067688 A067689
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| Drastich Stanislav (drass(AT)spas.sk), Feb 05 2002
|
| |
|
|
