|
| |
|
|
A071809
|
|
Smallest s such that sk-1 is squarefree for 1 <= k <= n.
|
|
0
| |
|
|
2, 2, 2, 2, 4, 4, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 12, 12, 24, 120, 120, 120, 120, 120, 150, 150, 150, 150, 240, 240, 240, 240, 240, 240, 300, 840, 840, 840, 840, 840, 840, 840, 840, 840, 840, 840, 840, 840, 840, 840, 840, 840, 840, 840, 840, 840, 840, 840
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
PROG
| (PARI) for(n=1, 57, s=1; while(sum(i=1, n, issquarefree(s*i-1))<n, s++); print1(s, ", "))
|
|
|
CROSSREFS
| Sequence in context: A035398 A104409 A032576 * A104976 A010334 A010578
Adjacent sequences: A071806 A071807 A071808 * A071810 A071811 A071812
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 06 2002
|
| |
|
|
