login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A240597
Numbers k such that sigma(k) == k (mod 9).
1
1, 15, 24, 42, 60, 64, 69, 78, 90, 100, 114, 123, 133, 147, 153, 177, 186, 198, 222, 231, 240, 258, 259, 270, 276, 288, 289, 306, 339, 360, 366, 393, 402, 403, 414, 429, 438, 447, 459, 474, 477, 492, 495, 501, 507, 511, 522, 582, 588, 594, 600
OFFSET
1,2
COMMENTS
That is, numbers k that satisfy the following:
A010878(k) = A105852(k) or A010878(k) = A010878(A000203(k)).
A010888(k) = A190998(k) or A010888(k) = A010888(A000203(k)).
LINKS
FORMULA
A010888(a(n)) = A010888(A000203(a(n))).
A010888(a(n)) = A190998(a(n)).
EXAMPLE
sigma(15) = 24. 24 == 15 (mod 9), therefore 15 is in the sequence.
MATHEMATICA
Select[Range[1000], Mod[#, 9]==Mod[DivisorSigma[1, #], 9]&]
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Ivan N. Ianakiev, Sep 13 2014
STATUS
approved