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 A307152 #24 Aug 11 2025 08:17:19
%S A307152 1,1,1,2,2,2,3,3,3,4,4,5,5,5,6,7,7,8,8,8,9,10,10,10,11,12,12,12,13,13,
%T A307152 14,14,15,15,16,17,17,17,17,18,18,19,19,20,22,22,23,24,24,24,25,25,26,
%U A307152 26
%N A307152 a(n) = floor((A002144(n)+19)/24).
%C A307152 This sequence arises in several different contexts [Kramer].
%C A307152 The number of occurrences of k in the sequence is A296021(6*k) - A296021(6*k-6). - _Robert Israel_, Mar 31 2019
%C A307152 Original name was: "Floor( (q+19)/24 ) where q is a prime == 1 (mod 4)." - _Robert Israel_, Apr 07 2019
%H A307152 Robert Israel, <a href="/A307152/b307152.txt">Table of n, a(n) for n = 1..10000</a>
%H A307152 Jürg Kramer, <a href="https://gdz.sub.uni-goettingen.de/id/PPN235181684_0281">On the linear independence of certain theta-series</a>, Mathematische Annalen 281.2 (1988): 219-228. See page 226.
%p A307152 map(t -> floor((t+19)/24), select(isprime, [seq(i,i=1..1000,4)])); # _Robert Israel_, Mar 31 2019
%t A307152 Table[Floor[(q + 19)/24], {q, Select[Range[1, 650, 4], PrimeQ]}] (* _Michael De Vlieger_, Mar 31 2019 *)
%Y A307152 Cf. A002144, A296021.
%K A307152 nonn
%O A307152 1,4
%A A307152 _N. J. A. Sloane_, Mar 31 2019