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 A262567 #20 Oct 20 2023 09:48:42 %S A262567 0,0,0,1,3,7,12,23,44,81,150,281,528,991,1871,3541,6719,12787,24384, %T A262567 46599,89240,171196,328959,633101,1220159,2354687,4549752,8801161, %U A262567 17043505,33038207,64103988,124491775,241969988,470681347,916259631,1784921473,3479467176,6787108712,13247128044,25870861823 %N A262567 a(n) = A002703(n)/2. %C A262567 A002703 is somewhat mysterious. Having four versions (A002703, this sequence, A262568, A262569) instead of one increases the chance that one of them will be found in a different context. %H A262567 Alexander Rosa and Štefan Znám, <a href="/A002703/a002703.pdf">A combinatorial problem in the theory of congruences. (Russian)</a>, Mat.-Fys. Casopis Sloven. Akad. Vied 15 1965 49-59. [Annotated scanned copy] %p A262567 See A262568. %Y A262567 Cf. A002703, A262568, A262569. %Y A262567 Tables 1 and 2 of the first Rosa-Znám 1965 paper are A053632 and A178666 respectively. %K A262567 nonn %O A262567 3,5 %A A262567 _N. J. A. Sloane_, Oct 20 2015 %E A262567 More terms from _R. J. Mathar_, Oct 21 2015