|
| |
|
|
A071577
|
|
Smallest k such that 2ik+1 is squarefree for 1<=i<=n.
|
|
0
| |
|
|
1, 1, 1, 5, 5, 5, 5, 9, 9, 9, 9, 9, 9, 9, 9, 63, 63, 63, 63, 63, 63, 63, 63, 135, 135, 135, 135, 135, 135, 135, 135, 135, 135, 135, 135, 135, 135, 135, 135, 135, 135, 135, 135, 735, 735, 735, 945, 945, 945, 1155, 1155, 1155, 1155, 1155, 1155, 1155
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,4
|
|
|
PROG
| (PARI) for(n=1, 56, s=1; while(sum(i=1, n, issquarefree(2*i*s+1))<n, s++); print1(s, ", "))
|
|
|
CROSSREFS
| Sequence in context: A139259 A105444 A033299 * A003870 A076407 A134701
Adjacent sequences: A071574 A071575 A071576 * A071578 A071579 A071580
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Benoit Cloitre (benoit7848c(AT)orange.fr), May 31 2002
|
| |
|
|
