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!)
 A086669 a(n) = number of divisors of n that are fundamental discriminants. 4
 1, 1, 1, 1, 2, 1, 1, 2, 1, 2, 1, 2, 2, 1, 2, 2, 2, 1, 1, 2, 2, 1, 1, 4, 2, 2, 1, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1, 2, 4, 2, 2, 1, 2, 2, 1, 1, 4, 1, 2, 2, 2, 2, 1, 2, 4, 2, 2, 1, 4, 2, 1, 2, 2, 4, 2, 1, 2, 2, 2, 1, 4, 2, 2, 2, 2, 2, 2, 1, 4, 1, 2, 1, 4, 4, 1, 2, 4, 2, 2, 2, 2, 2, 1, 2, 4, 2, 1, 2, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,5 LINKS Antti Karttunen, Table of n, a(n) for n = 1..16385 FORMULA a(n) = Sum_{d|n} A290098(d). EXAMPLE 10 has divisors 1, 2, 5 and 10 of which 1 and 5 are fundamental discriminants, so a(10)=2 PROG (PARI) for (n=1, 100, s=0; fordiv(i=n, i, s+=isfundamental(i)); print1(", "s)) (PARI) A086669(n) = sumdiv(n, i, isfundamental(i)); \\ Antti Karttunen, Aug 22 2017 CROSSREFS Cf. A003658, A290098. Sequence in context: A253051 A103684 A105103 * A053574 A321944 A065203 Adjacent sequences:  A086666 A086667 A086668 * A086670 A086671 A086672 KEYWORD nonn AUTHOR Jon Perry, Jul 27 2003 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 June 14 15:19 EDT 2021. Contains 345025 sequences. (Running on oeis4.)