|
|
A072984
|
|
Least k such that prime(n) appears in the factorization of A001008(k) (the numerator of the k-th harmonic number).
|
|
9
|
|
|
2, 4, 6, 3, 12, 16, 18, 22, 13, 30, 17, 40, 13, 46, 22, 58, 10, 66, 70, 72, 78, 82, 88, 11, 100, 102, 106, 25, 112, 126, 130, 5, 138, 148, 150, 156, 162, 166, 71, 178, 180, 190, 192, 196, 38, 210, 222, 22, 228, 232, 238, 240, 250, 66, 262, 33, 58, 276, 280, 282
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
2,1
|
|
COMMENTS
|
a(n)<=n for n =2,5,14,18,25,29,33,46,49,...
For p = prime(n), Boyd defines J_p to be the set of numbers k such that p divides A001008(k). This sequence gives the smallest elements of J_p. The largest elements of J_p are given by A177734. The sizes of J_p are given by A092103.
|
|
LINKS
|
|
|
MATHEMATICA
|
p = Prime[n]; k = 1; sum = 1/k;
While[! Divisible[Numerator[sum], p],
k++; sum += 1/k];
Return[k]];
|
|
PROG
|
(PARI) a(n)=if(n<0, 0, s=1; while(numerator(sum(k=1, s, 1/k))%prime(n)>0, s++); s)
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|