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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A337346 Number of proper divisors d of n for which A003961(d) > 2*d. 6
0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 2, 0, 0, 0, 2, 0, 2, 0, 2, 0, 0, 0, 4, 0, 0, 1, 2, 0, 3, 0, 3, 0, 0, 0, 5, 0, 0, 0, 4, 0, 3, 0, 1, 2, 0, 0, 6, 0, 1, 0, 1, 0, 4, 0, 4, 0, 0, 0, 7, 0, 0, 2, 4, 0, 1, 0, 1, 0, 3, 0, 8, 0, 0, 1, 1, 0, 2, 0, 6, 2, 0, 0, 7, 0, 0, 0, 3, 0, 7, 0, 1, 0, 0, 0, 8, 0, 2, 1, 4, 0, 1, 0, 3, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,12

COMMENTS

Number of terms of A246282 less than n that divide n.

Number of proper divisors d of n for which A048673(d) > d.

LINKS

Antti Karttunen, Table of n, a(n) for n = 1..65537

Index entries for sequences computed from indices in prime factorization

FORMULA

a(n) = Sum_{d|n, d<n} A252742(d).

a(n) = A337345(n) - A252742(n).

PROG

(PARI)

A003961(n) = { my(f = factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); };

A337346(n) = sumdiv(n, d, (d<n)&&(A003961(d)>(d+d)));

CROSSREFS

Cf. A003961, A048673, A246282, A252742, A337345, A337372.

Cf. also A294929.

Sequence in context: A097249 A112313 A297115 * A294902 A321516 A172246

Adjacent sequences:  A337343 A337344 A337345 * A337347 A337348 A337349

KEYWORD

nonn

AUTHOR

Antti Karttunen, Aug 27 2020

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 21 05:28 EDT 2021. Contains 348141 sequences. (Running on oeis4.)