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 A025490 #49 Jan 05 2025 19:51:35 %S A025490 0,1,5,13,41,53,55,60,61,90,97,169,185,193,215,265,269,353,355,385, %T A025490 397,437,481,493,617,629,630,653,713,750,769,780,889,905,960,1013, %U A025490 1025,1045,1205,1320,1405,1435,1501,1620,1650,1657,1705,1735,1769,1793,1913,1981 %N A025490 Numbers k such that the sum of the digits of Fibonacci(k) in base 11 is k. %C A025490 In his article, Terr estimated the number of terms to be 684 +- 26, which agrees with the found count of 710. - _Sven Simon_, Aug 06 2006 %H A025490 Sven Simon, <a href="/A025490/b025490.txt">Table of n, a(n) for n = 1..711</a> [May be complete] %H A025490 David Terr, <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/Scanned/34-4/terr.pdf">On the Sums of Digits of Fibonacci Numbers,</a> Fibonacci Quarterly 34, Aug. 1996, pp. 349-355. %o A025490 (PARI) isok(n) = sumdigits(fibonacci(n), 11) == n; \\ _Michel Marcus_, Jun 08 2019 %o A025490 (Magma) [k:k in [0..2000]| &+Intseq(Fibonacci(k),11) eq k]; // _Marius A. Burtea_, Jun 09 2019 %Y A025490 Cf. A020995 (base 10), A020996 (base 12). %Y A025490 Cf. A025491 (with Lucas numbers). %K A025490 base,nonn %O A025490 1,3 %A A025490 _David W. Wilson_ %E A025490 Title clarified and offset changed to 1 by _Sean A. Irvine_, May 06 2019