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 A256967 #18 May 22 2025 10:21:42 %S A256967 1,2,4,7,10,14,18,22,27,32,37,42,47,53,59,65,71,77,83,89,95,102,109, %T A256967 116,123,130,137,144,151,158,165,172,179,186,194,202,210,218,226,234, %U A256967 242,250,258,266,274,282,290,298,306,314,322,330 %N A256967 a(n) = A256966(n) + 1. %H A256967 Chai Wah Wu, <a href="/A256967/b256967.txt">Table of n, a(n) for n = 1..10000</a> %H A256967 Popular Computing (Calabasas, CA), <a href="/A256967/a256967.png">A Coding Exercise (from a suggestion by R. W. Hamming)</a>, Vol. 5 (No. 54, Sep 1977), p. PC55-18. [Asks what is a(n)?] %o A256967 (Python) %o A256967 A256967_list, x, d, f1, f2 = [], 1, 1, 1, 0 %o A256967 for _ in range(20): %o A256967 for i in range(f1): %o A256967 A256967_list.append(x) %o A256967 x += d %o A256967 d += 1 %o A256967 f1, f2 = f1 + f2, f1 %o A256967 # _Chai Wah Wu_, Apr 19 2015 %Y A256967 Cf. A072649, A256966. %K A256967 nonn %O A256967 1,2 %A A256967 _N. J. A. Sloane_, Apr 16 2015