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 A095269 #9 May 19 2024 03:20:35
%S A095269 0,0,0,0,3,0,0,0,0,0,3,0,10,0,0,0,3,0,0,0,0,0,3,0,10,0,7,0,3,0,7,7,0,
%T A095269 0,3,0,8,0,8,0,3,0,0,0,11,0,3,0,34,0,8,19,3,0,10,13,61,0,3,0,0,7,0,0,
%U A095269 3,0,7,0,8,0,3,0,10,0,0,0,3,0,32,0,7,0,3,0,58,0,7,0,3,0,0
%N A095269 Diving index of 4n+3.
%C A095269 Diving index of an odd number n is the first integer u > 1 where Sum_{i=1..u} J(i/n) results -1 and zero if never. Here J(i/n) is Jacobi symbol of i and n, which reduces to a Legendre symbol L(i/n) when n is a prime.
%H A095269 Antti Karttunen and J. Moyer, <a href="/A095062/a095062.c.txt">C-program for computing the initial terms of this sequence</a>
%F A095269 a(n) = A095270(n)+1 modulo A004767(n).
%Y A095269 Cf. A004767, A095270, A095109, A095271 (same sequence with zeros removed).
%K A095269 nonn
%O A095269 0,5
%A A095269 _Antti Karttunen_, Jun 01 2004