|
|
A110368
|
|
Integers with mutual residues of 9.
|
|
1
|
|
|
10, 19, 199, 37819, 1429936399, 2044718092315659619, 4180872077042990313463432060226288599, 17479691324597767931283328689425028720038746822457352536058485868000785419
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
This is the special case k=9 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.
|
|
LINKS
|
|
|
FORMULA
|
a(n) ~ c^(2^n), where c = 1.9324294501525084771045650938374200605001383645783351474944965038078432359... . - Vaclav Kotesovec, Dec 17 2014
|
|
MATHEMATICA
|
RecurrenceTable[{a[1]==10, a[n]==a[n-1]*(a[n-1]-9)+9}, a, {n, 1, 10}] (* Vaclav Kotesovec, Dec 17 2014 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|