login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A054762
a(n) is a cube mod a(i) for all i < n.
2
1, 2, 3, 4, 5, 7, 8, 13, 21, 27, 64, 91, 125, 161, 181, 216, 343, 512, 629, 729, 1000, 1079, 1331, 1728, 2197, 2267, 2744, 3151, 3375, 4096, 4913, 5741, 5832, 6733, 6859, 8000, 9261, 10648, 12167, 13824, 15625, 17576, 18773, 19683, 21952, 23561, 24389, 27000
OFFSET
1,2
LINKS
Sean A. Irvine, Java program (github)
MAPLE
q:= proc(n) option remember; {seq(irem(i^3, n), i=1..n)} end:
a:= proc(n) option remember; local k, l; l:= [seq(a(i), i=1..n-1)];
for k from a(n-1)+1 while not andmap(x-> irem(k, x) in q(x), l)
do od: k
end: a(1):=1:
seq(a(n), n=1..48); # Alois P. Heinz, Feb 23 2022
MATHEMATICA
q[n_] := q[n] = Table[Mod[i^3, n], {i, 1, n}] // Union;
a[n_] := a[n] = Module[{k, l}, l = Array[a, n-1];
For[k = a[n-1]+1, !AllTrue[l, MemberQ[q[#], Mod[k, #]]&], k++]; k];
a[1] = 1;
Table[a[n], {n, 1, 48}] (* Jean-François Alcover, May 20 2022, after Alois P. Heinz *)
CROSSREFS
Cf. A034793.
Sequence in context: A309708 A285929 A309880 * A039088 A111794 A030290
KEYWORD
nonn
AUTHOR
Henry Bottomley, May 15 2000
EXTENSIONS
Corrected and extended by Sean A. Irvine, Feb 22 2022
STATUS
approved