The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A294904 Number of divisors of n that are in A175526. 7
 0, 0, 0, 1, 0, 1, 0, 2, 1, 1, 0, 3, 0, 1, 1, 3, 0, 3, 0, 3, 1, 1, 0, 5, 0, 1, 2, 3, 0, 4, 0, 4, 1, 1, 1, 6, 0, 1, 1, 5, 0, 4, 0, 3, 3, 1, 0, 7, 1, 2, 1, 3, 0, 5, 1, 5, 1, 1, 0, 8, 0, 1, 3, 5, 1, 4, 0, 3, 1, 4, 0, 9, 0, 1, 2, 3, 1, 4, 0, 7, 3, 1, 0, 8, 1, 1, 1, 5, 0, 8, 1, 3, 1, 1, 0, 9, 0, 3, 3, 5, 0, 4, 0, 5, 4, 1, 0, 9, 0, 4, 0, 7, 0, 4, 1, 3, 3, 1, 0, 12 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,8 COMMENTS Number of terms of A175526 that divide n. LINKS Antti Karttunen, Table of n, a(n) for n = 1..25000 FORMULA a(n) = Sum_{d|n} (1-A294905(d)). a(n) = 1 + (A294902(n)-A294905(n)). a(n) + A294903(n) = A000005(n). PROG (PARI) A292257(n) = sumdiv(n, d, (d

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 25 00:48 EDT 2020. Contains 337333 sequences. (Running on oeis4.)