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!)
A349866 Fixed points of A318996. 0
4, 45, 6048, 14421, 26409026, 29270772, 30685402 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Integers m such that Sum_{d|m} (sigma(m) mod d) = m.
LINKS
Carlos Rivera, Puzzle 1065. A larger integer than 45 such that ..., The Prime Puzzles and Problems Connection.
EXAMPLE
The sum of divisors of 4 is 7 with divisors 1, 2, 4; And (7 mod 1) + (7 mod 2) + (7 mod 4) = 0 + 1 + 3 = 4.
PROG
(PARI) isok(m) = my(sn = sigma(m)); sumdiv(m, d, sn % d) == m;
(Python)
from itertools import count, islice
from sympy import divisor_sigma, divisors
def A349866gen(): # generator of terms
return filter(lambda m: sum(divisor_sigma(m) % d for d in divisors(m, generator=True)) == m, count(1))
A349866_list = list(islice(A349866gen(), 4)) # Chai Wah Wu, Dec 03 2021
CROSSREFS
Sequence in context: A189273 A288554 A288562 * A222899 A119729 A374591
KEYWORD
nonn,more
AUTHOR
Michel Marcus, Dec 03 2021
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 July 27 23:49 EDT 2024. Contains 374651 sequences. (Running on oeis4.)