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 A095270 #9 May 19 2024 03:20:43 %S A095270 2,6,10,14,2,22,26,30,34,38,2,46,9,54,58,62,2,70,74,78,82,86,2,94,9, %T A095270 102,6,110,2,118,6,6,130,134,2,142,7,150,7,158,2,166,170,174,10,182,2, %U A095270 190,33,198,7,18,2,214,9,12,60,230,2,238,242,6,250,254,2,262 %N A095270 Length of maximal Motzkin path prefix in the Jacobi-vector of 4n+3. %H A095270 Antti Karttunen and J. Moyer, <a href="/A095062/a095062.c.txt">C-program for computing the initial terms of this sequence</a> %F A095270 a(n) = A095269(n)-1 modulo A004767(n). %Y A095270 Cf. A004767, A095269, A095110, A095105. %K A095270 nonn %O A095270 1,1 %A A095270 _Antti Karttunen_, Jun 01 2004