|
| |
|
|
A099642
|
|
a(n) is the smallest composite solution to tau[x+n]=tau[x]+n, where tau[]~A000005[], the number of divisors.
|
|
0
| |
|
|
1, 10, 9, 26, 25, 74, 169, 82, 441, 170, 133, 348, 6889, 166, 3025, 344, 559, 1602, 9981, 820, 9979, 986, 4333, 1236, 9191, 694, 3249, 1652, 3481, 9378, 34969, 3118, 859329, 5636, 36829, 3324, 51947, 3994, 6561, 5000, 15835, 16806, 944741, 6436, 119025
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
EXAMPLE
| n=5: a(5)=25 because tau(25)+5=3+5=8=tau(25+5)=tau(30)
|
|
|
MATHEMATICA
| ds[x_, de_] :=DivisorSigma[0, x+de]-DivisorSigma[0, x]-de; a[n_] :=Block[{m=1, s=ds[m, n]}, While[(s!=0||PrimeQ[m])&&!Greater[m, 10000000], m++ ]; m];
|
|
|
CROSSREFS
| Cf. A000005, A054905.
Sequence in context: A063596 A184959 A003568 * A052196 A070252 A038311
Adjacent sequences: A099639 A099640 A099641 * A099643 A099644 A099645
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Labos E. (labos(AT)ana.sote.hu), Nov 02 2004
|
| |
|
|
