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 A362199 #22 Dec 23 2024 13:58:15 %S A362199 1,2,2,3,6,3,1,5,2,9,8,7,5,0,6,5,6,7,2,0,6,7,7,6,2,6,8,3,1,7,6,3,1,2, %T A362199 4,6,2,1,6,2,2,6,4,6,6,0,0,2,7,1,6,1,4,9,0,9,0,6,4,6,8,9,4,4,5,6,4,1, %U A362199 9,6,8,8,4,9,8,7,5,6,4,5,4,9,7,2,8,9,7,1,6,2,6,1,2,7,7,9,0,1,4,6,8,5,6,4,4 %N A362199 Decimal expansion of the sum of the reciprocals of the Busy Beaver numbers (A060843). %C A362199 Equal to 1/BB(1) + 1/BB(2) + 1/BB(3) + ... = 1/A060843(1) + 1/A060843(2) + 1/A060843(3) + ... %C A362199 A homework assignment in Scott Aaronson's "PHYS771 Lecture 3: Gödel, Turing, and Friends" (see links) asks if 1/BB(1) + 1/BB(2) + 1/BB(3) + ... is a computable real number. Scott Aaronson's "PHYS771 Lecture 4: Minds and Machines" (see links), which provides the answers to the homework assignment, proves that the number is not computable. %C A362199 Because BB(5) was proved to be 47176870 (see here https://discuss.bbchallenge.org/t/july-2nd-2024-we-have-proved-bb-5-47-176-870/237) and BB(6) was proved to be greater than 10^^15 (see here https://www.sligocki.com/2022/06/21/bb-6-2-t15.html), over 10^14 terms are known. - _Matthew Schulz_, Dec 13 2024. %H A362199 Matthew Schulz, <a href="/A362199/b362199.txt">Table of n, a(n) for n = 1..20000</a> %H A362199 Scott Aaronson, <a href="https://www.scottaaronson.com/democritus/lec3.html">PHYS771 Lecture 3: Gödel, Turing, and Friends</a>. %H A362199 Scott Aaronson, <a href="https://www.scottaaronson.com/democritus/lec4.html">PHYS771 Lecture 4: Minds and Machines</a>. %F A362199 1/A060843(1) + 1/A060843(2) + 1/A060843(3) + ... %e A362199 1.22363152987506567206776268317631246216226466... %Y A362199 Cf. A060843. %K A362199 nonn,cons,hard %O A362199 1,2 %A A362199 _Robert C. Lyons_, Apr 10 2023 %E A362199 a(8) onwards from _Matthew Schulz_, Dec 13 2024