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 A307610 #11 Sep 26 2023 09:02:30
%S A307610 1,1,2,1,1,1,2,1,2,1,2,1,3,1,1,2,2,1,2,2,1,1,3,1,2,2,1,1,2,1,2,2,1,2,
%T A307610 1,1,1,1,1,2,1,2,1,1,3,3,2,3,1,1,2,1,1,3,1,2,2,2,1,3,1,1,1,5,1,1,2,1,
%U A307610 1,2,2,1,1,2,2,1,1,1,3,1,1,2,2,1,3,2,2,2,1,2,1,2,2,3,2,2,1,1,2
%N A307610 Number of partitions of prime(n) into consecutive primes.
%C A307610 a(n) - 1 = number of partitions of prime(n) into two or more consecutive primes. - _Ray Chandler_, Sep 26 2023
%H A307610 Ray Chandler, <a href="/A307610/b307610.txt">Table of n, a(n) for n = 1..1000</a>
%F A307610 a(n) = [x^prime(n)] Sum_{i>=1} Sum_{j>=i} Product_{k=i..j} x^prime(k).
%F A307610 a(n) = A054845(A000040(n)).
%e A307610 prime(13) = 41 = 2 + 3 + 5 + 7 + 11 + 13 = 11 + 13 + 17, so a(13) = 3.
%Y A307610 Cf. A000040, A034707, A054845, A056768, A070215, A084143.
%K A307610 nonn
%O A307610 1,3
%A A307610 _Ilya Gutkovskiy_, Apr 18 2019