This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A322586 a(n) = 1 if n is a highly composite number (A002182), 0 otherwise. 3
 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1 COMMENTS Characteristic function of A002182, first differences of A261100, MÃ¶bius transform of A181801. LINKS Antti Karttunen, Table of n, a(n) for n = 1..83160 FORMULA a(1) = 1; for n > 1, a(n) = A261100(n) - A261100(n-1). For all n, a(n) <= A322585(n). PROG (PARI) v002182 = vector(128); v002182[1] = 1; \\ For memoization. A002182(n) = { my(d, k); if(v002182[n], v002182[n], k = A002182(n-1); d = numdiv(k); while(numdiv(k) <= d, k=k+1); v002182[n] = k; k); }; A261100(n) = { my(k=1); while(A002182(k)<=n, k=k+1); (k-1); }; A322586(n) = if(1==n, 1, (A261100(n)-A261100(n-1))); CROSSREFS Cf. A002182, A181801, A261100 (partial sums), A322585. Sequence in context: A167501 A285533 A185175 * A147612 A323509 A197183 Adjacent sequences:  A322583 A322584 A322585 * A322587 A322588 A322589 KEYWORD nonn AUTHOR Antti Karttunen, Dec 20 2018 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 17 22:53 EDT 2019. Contains 327147 sequences. (Running on oeis4.)