A162322 Take sequence A000005 (where A000005(n) = the number of divisors of n). To get {a(k)}, replace each run of multiple occurrences of the same integer in sequence A000005 with just one occurrence of that integer, such that a(n) never equals a(n+1).

1, 2, 3, 2, 4, 2, 4, 3, 4, 2, 6, 2, 4, 5, 2, 6, 2, 6, 4, 2, 8, 3, 4, 6, 2, 8, 2, 6, 4, 9, 2, 4, 8, 2, 8, 2, 6, 4, 2, 10, 3, 6, 4, 6, 2, 8, 4, 8, 4, 2, 12, 2, 4, 6, 7, 4, 8, 2, 6, 4, 8, 2, 12, 2, 4, 6, 4, 8, 2, 10, 5, 4, 2, 12, 4, 8, 2, 12, 4, 6, 4, 12, 2, 6, 9, 2, 8, 2, 8, 4, 2, 12, 2, 8, 4, 10, 2, 8, 4, 6, 4

Offset

1,2

Links

Table of n, a(n) for n=1..101.

Maple

read("transforms3") ; a000005 := BFILETOLIST("b000005.txt") ; op(1..120, LISTNODUPL(a000005)) ; # R. J. Mathar, Aug 01 2009

Crossrefs

Cf. A000005.

Sequence in context: A101743 A224925 A060937 * A336155 A196930 A305437

Adjacent sequences: A162319 A162320 A162321 * A162323 A162324 A162325

Keyword

nonn

Author

Leroy Quet, Jul 01 2009

Extensions

More terms from R. J. Mathar, Aug 01 2009

Status

approved