login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A294930 Characteristic function for A091191, primitive abundant numbers: abundant numbers (A005101) having no abundant proper divisor. 7
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 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, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET
1
LINKS
FORMULA
a(n) = A294937(n) * [0==A294929(n)].
a(n) = 1 iff A080224(n) = 1.
MATHEMATICA
a[n_] := Boole[Count[Divisors[n], _?(DivisorSigma[1, #] > 2*# &)] == 1]; Array[a, 100] (* Amiram Eldar, Mar 18 2024 *)
PROG
(PARI)
A294937(n) = (sigma(n)>(2*n));
A294929(n) = sumdiv(n, d, (d<n)*A294937(d));
A294930(n) = (A294937(n)*(0==A294929(n)));
CROSSREFS
Sequence in context: A353474 A065202 A323547 * A353472 A359475 A294937
KEYWORD
nonn,changed
AUTHOR
Antti Karttunen, Nov 14 2017
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 10:55 EDT 2024. Contains 371241 sequences. (Running on oeis4.)