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!)
 A290468 Numbers x such that x = Sum_{i=1..k} (x mod d_(x-i)) for some k, where d_(x-i) is the aliquot parts of (x-i). 3
 11, 13, 14, 15, 18, 40, 60, 83, 205, 226, 234, 244, 267, 310, 321, 336, 341, 462, 543, 572, 610, 757, 766, 771, 802, 826, 919, 968, 993, 1089, 1366, 1391, 1734, 1758, 1863, 1911, 1985, 1993, 2095, 2222, 2396, 2405, 2422, 2522, 3495, 3634, 3655, 3672, 3823, 3870 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Values of k for the listed terms are 5, 7, 6, 9, 10, 7, 8, 7, 11, 11, 12, 12, 12, 13, 13, 15, 14, 17, 15, 18, 16, 20, 18, 19, 20, 20, 19, 22, 21, 23, 24, 25, 26, 29, 28, 28, 29, 30, 29, 30, 31, 29, 30, 33, 37, 36, 39, 39, 41, 41, ... LINKS Paolo P. Lava, Table of n, a(n) for n = 1..500 EXAMPLE For 11 the value of k is 5. Aliquot parts of 10, 9, 8, 7 and 6 are: [1, 2, 5], [1, 3], [1, 2, 4], [1], [1, 2, 3]. Residues are 0 + 1 + 1 + 0 + 2 + 0 + 1 + 3 + 0 + 0 + 1 + 2 that sum up to 11. MAPLE with(numtheory): P:=proc(q) local a, b, j, k, n; for n from 6 to q do a:=0; k:=0; while a

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 6 10:24 EST 2021. Contains 349563 sequences. (Running on oeis4.)