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 A331976 #26 May 01 2025 08:31:06
%S A331976 1,77,319,323,1517,3021,4757,6479,7221,8159,8229,9797,11663,12597,
%T A331976 13629,13869,14429,14949,16637,18407,19043,19437,23407,24947,25437,
%U A331976 30049,30621,34943,34989,35207,39203,43677,44099,47519,51983,53663,55221,65471,70221,77837,78089,79547
%N A331976 Odd integers m that divide the sum of the first m nonzero Fibonacci numbers.
%C A331976 Not all terms are squarefree, for instance 13869, 14949, 43677, 93357, ... are not.
%C A331976 A subsequence of A124456, missing just the even terms A124456({2, 155, 397, 469, ...}) = {2, 758624, 7057466, 10805846, ...}. - _M. F. Hasler_, Feb 06 2020
%C A331976 There are infinitely many terms. - _Oisín Flynn-Connolly_, May 01 2025
%H A331976 Giovanni Resta, <a href="/A331976/b331976.txt">Table of n, a(n) for n = 1..10000</a>
%H A331976 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 A331976 Daniel Yaqubi and Amirali Fatehizadeh, <a href="https://arxiv.org/abs/2001.11839">Some results on average of Fibonacci and Lucas sequences</a>, arXiv:2001.11839 [math.CO], 2020.
%F A331976 Equals A124456 without even terms. - _M. F. Hasler_, Feb 06 2020
%o A331976 (PARI) forstep(n=1,oo,2, is_A111035(n) && print1(n",")) \\ _M. F. Hasler_, Feb 06 2020
%Y A331976 Odd terms in A111035, A124456.
%K A331976 nonn
%O A331976 1,2
%A A331976 _Michel Marcus_, Feb 03 2020