login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A255243 Number x such that x | A255242(x). 2
1, 4, 10, 16, 18, 64, 80, 96, 195, 256, 462, 576, 768, 880, 1024, 2560, 3120, 3136, 4096, 6656, 16384, 40704, 53248, 57344, 64000, 65536, 67896, 78864, 80640, 101376, 103680, 120320, 120336, 125440, 126208, 139264, 147968, 195840, 217600, 225280, 250624, 262144 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

For 4, 10, 195 we have x = A255242(x).

LINKS

Amiram Eldar, Table of n, a(n) for n = 1..50

EXAMPLE

For a(1) = 1 we have sigma(1) - 1 = 0 and 0 / 1 = 0.

Aliquot parts of a(2) = 4 are 1, 2 and their sum is 3.

Let us repeat the calculation with 1 and 2: 1 => 0; 2 => 1.

Their sum is 1. Finally, 3 + 1 = 4 and 4 / 4 = 1.

Aliquot parts of a(3) = 10 are 1, 2, 5. Their sum is 8.

Let us repeat the calculation with 1, 2 and 5: 1 => 0; 2 => 1; 5 => 1.

Their sum is 2. Finally, 8 + 2 = 10 and 10 / 10 = 1.

Aliquot parts of a(4) = 16 are 1, 2, 4, 8. Their sum is 15.

Let us repeat the calculation with 1, 2, 4 and 8: 1 => 0; 2 => 1; 4 => 1, 2; 8 => 1, 2, 4.

Their sum is 1 + 1 + 2 + 1 + 2 + 4 = 11.

Repeat the calculation with 1, 1, 2, 1, 2, 4: 1 => 0; 1 => 0; 2 => 1; 1 => 0; 2 => 1;  4 => 1, 2.

Their sum is 1 + 1 + 1 + 2 = 5.

Repeat the calculation with 1, 1, 1, 2: 1 => 0; 1 => 0; 1 => 0; 2 => 1; Their sum is 1.

Finally, 15 + 11 + 5 + 1 = 32 and 32 / 16 = 2.

MAPLE

with(numtheory): P:=proc(q) local a, b, c, k, n, t, v;

for n from 1 to q do b:=0; a:=sort([op(divisors(n))]); t:=nops(a)-1;

while add(a[k], k=1..t)>0 do b:=b+add(a[k], k=1..t); v:=[];

for k from 2 to t do c:=sort([op(divisors(a[k]))]); v:=[op(v), op(c[1..nops(c)-1])]; od;

a:=v; t:=nops(a); od; if type(b/n, integer) then print(n); fi; od; end: P(10^9);

MATHEMATICA

f[s_] := Flatten[Most[Divisors[#]] & /@ s]; a[n_] := Total@Flatten[FixedPointList[ f, {n}]] - n; Select[Range[10000], Divisible[a[#], #] &] (* Amiram Eldar, Apr 06 2019 *)

CROSSREFS

Cf. A001065, A255242.

Sequence in context: A310483 A310484 A310485 * A162410 A310486 A310487

Adjacent sequences:  A255240 A255241 A255242 * A255244 A255245 A255246

KEYWORD

nonn

AUTHOR

Paolo P. Lava, Feb 19 2015

EXTENSIONS

a(32)-a(42) from Amiram Eldar, Apr 06 2019

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 December 13 17:09 EST 2019. Contains 329970 sequences. (Running on oeis4.)