|
Search: id:A137518
|
|
|
| A137518 |
|
a(1)=2. For n>=2, a(n) = smallest integer > a(n-1) that has the same number of divisors as n has. |
|
+0
1
|
|
| 2, 3, 5, 9, 11, 14, 17, 21, 25, 26, 29, 32, 37, 38, 39, 81, 83, 92, 97, 98, 106, 111, 113, 114, 121, 122, 123, 124, 127, 128, 131, 147, 155, 158, 159, 196, 197, 201, 202, 222, 223, 230, 233, 236, 242, 247, 251, 272, 289, 292, 295, 316, 317, 318, 319, 322, 323
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Starting the sequence at a(1)=1 instead would lead to a(n) = n for all positive integers n.
|
|
MATHEMATICA
|
a = {2}; Do[i = a[[ -1]] + 1; While[ ! Length[Divisors[i]] == Length[Divisors[n]], i++ ]; AppendTo[a, i], {n, 2, 80}]; a - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Apr 26 2008
|
|
CROSSREFS
|
Sequence in context: A067139 A014657 A140329 this_sequence A137509 A014109 A102940
Adjacent sequences: A137515 A137516 A137517 this_sequence A137519 A137520 A137521
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Leroy Quet (q1qq2qqq3qqqq(AT)yahoo.com), Apr 24 2008
|
|
EXTENSIONS
|
More terms from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Apr 26 2008
|
|
|
Search completed in 0.002 seconds
|
