|
| |
|
|
A072866
|
|
Smallest k > 1 dividing tau(k*2^n) (cf. A000005).
|
|
0
| |
|
|
2, 4, 2, 10, 2, 3, 2, 6, 2, 4, 2, 3, 2, 4, 2, 12, 2, 3, 2, 5, 2, 4, 2, 3, 2, 4, 2, 7, 2, 3, 2, 6, 2, 4, 2, 3, 2, 4, 2, 5, 2, 3, 2, 6, 2, 4, 2, 3, 2, 4, 2, 12, 2, 3, 2, 6, 2, 4, 2, 3, 2, 4, 2, 10, 2, 3, 2, 6, 2, 4, 2, 3, 2, 4, 2, 12, 2, 3, 2, 5, 2, 4, 2, 3, 2, 4, 2, 11, 2, 3, 2, 6, 2, 4, 2, 3, 2, 4, 2, 5, 2, 3
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
COMMENTS
| Sequence contains the values 2,3,4,5,6,7,10,11,12 only. Is there any pattern ? a(m) = 4 for m =1,9,13,21,25,33,37,45,49,...This subsequence has the recurrence b(1)=1, b(2k)=b(2k-1)+8, b(2k+1)=b(2k)+4. If a(m) = 10 then m == 0 (mod 3). If m>n, a(n)=10, a(m)=10 then m-n == 0 (mod 60).
|
|
|
CROSSREFS
| Sequence in context: A058942 A196759 A188813 * A061393 A055935 A086930
Adjacent sequences: A072863 A072864 A072865 * A072867 A072868 A072869
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Benoit Cloitre (benoit7848c(AT)orange.fr), Jul 27 2002
|
| |
|
|
