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

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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A240895 Consider a number of k digits n = d_(k)*10^(k-1) + d_(k-1)*10^(k-2) + … + d_(2)*10 + d_(1). Sequence lists the numbers n such that sigma(n) - n = Sum_{i=1..k-1}{sigma(Sum_{j=1..i}{d_(j)*10^(j-1)})}} (see example below). 2
 11, 25, 31, 41, 61, 71, 341, 671, 2119, 10231, 39579, 52231, 60341, 402959, 1288689, 1393059, 1956759, 16752951, 108659999, 181704519, 794033191, 1062726071, 3518397571, 4062296851, 4085227151, 7015608139 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS a(27) > 10^10. - Giovanni Resta, Apr 16 2014 LINKS EXAMPLE If n = 52231, starting from the least significant digit, let us cut the number into the set 1, 31, 231, 2231. We have: sigma(1) = 1; sigma(31) = 32; sigma(231) = 384; sigma(2231) = 2352 and 1 + 32 + 384 + 2352 = 2769 = sigma(52231) - 52231. MAPLE with(numtheory); P:=proc(q) local a, k, n; for n from 2 to q do a:=0; k:=1; while (n mod 10^k)

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 December 9 02:53 EST 2021. Contains 349625 sequences. (Running on oeis4.)