|
|
A067686
|
|
a(n) = a(n-1) * a(n-1) - B * a(n-1) + B, a(0) = 1 + B for B = 7.
|
|
3
|
|
|
|
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, Sep 04 2005
|
|
LINKS
|
|
|
FORMULA
|
a(n) ~ c^(2^n), where c = 3.3333858371760195832345950846454963835549715770476958790043961891683146201... . - Vaclav Kotesovec, Dec 17 2014
|
|
MATHEMATICA
|
RecurrenceTable[{a[0]==8, a[n]==a[n-1]*(a[n-1]-7)+7}, a, {n, 0, 10}] (* Vaclav Kotesovec, Dec 17 2014 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
Drastich Stanislav (drass(AT)spas.sk), Feb 05 2002
|
|
STATUS
|
approved
|
|
|
|