This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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). 0
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS MAPLE read("transforms3") ; a000005 := BFILETOLIST("b000005.txt") ; op(1..120, LISTNODUPL(a000005)) ; [From R. J. Mathar, Aug 01 2009] CROSSREFS Sequence in context: A101743 A224925 A060937 * A196930 A305437 A111982 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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 22 22:58 EDT 2018. Contains 316518 sequences. (Running on oeis4.)