This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A383021 #50 May 03 2025 23:44:18 %S A383021 1,2,3,12,24,34,36,46,48,60,68,72,92,94,96,106,108,120,144,166,168, %T A383021 180,188,192,212,214,216,226,240,274,288,300,324,332,334,336,346,360, %U A383021 384,394,428,432,452,454,466,480,504,514,526,540,548,552,576,586,600,612 %N A383021 Self-summable Fibonacci numbers: integers k such that Fibonacci(k) divides the sum of the first Fibonacci(k) nonzero Fibonacci numbers. %C A383021 Same as integers k such that Fibonacci(k) divides Fibonacci(Fibonacci(k)+2)-1. %C A383021 Contains infinitely many terms. %C A383021 Contains all 2p and 4p such that p is prime and p = 2,8 mod 15. %C A383021 Fibonacci(k) is a subsequence of A124456. %H A383021 Amirali Fatehizadeh and Daniel Yaqubi, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL25/Yaqubi/yaq6.html">Average of the Fibonacci numbers</a>, J. Integer Seq. 25 (2022), no. 2, Art. 22.2.6, 10 pp. %H A383021 Oisín Flynn-Connolly, <a href="https://arxiv.org/abs/2504.09938">On the divisibility of sums of Fibonacci numbers</a>, arXiv:2504.09938 [math.NT], 2025. %H A383021 Michal Křížek and Lawrence Somer, <a href="https://math.colgate.edu/~integers/y36/y36.pdf">Period lengths modulo n and average of terms of second order linear recurrences</a>, Integers 24 (2024), Paper No. A36, 41 pp. %Y A383021 Cf. A000045, A124456, A158569, A331976, A381053. %K A383021 nonn %O A383021 1,2 %A A383021 _Oisín Flynn-Connolly_, Apr 12 2025 %E A383021 More terms from _Alois P. Heinz_, Apr 14 2025