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 A071215 #30 Jan 20 2025 05:34:23
%S A071215 1,1,2,2,2,3,2,3,2,3,2,3,3,3,2,2,3,1,3,2,2,2,2,3,3,3,4,2,3,3,3,2,3,2,
%T A071215 3,3,2,4,3,2,3,3,2,4,3,3,3,3,3,4,2,3,3,2,3,3,3,2,3,3,2,3,3,3,4,2,2,3,
%U A071215 3,3,2,3,3,2,3,2,3,4,3,3,4,3,2,2,3,2,3,3,4,4,3,4,3,4,3,3,3,3,3,2,3,3,2,4,3
%N A071215 Number of distinct prime factors of sum of 2 successive primes.
%H A071215 G. C. Greubel, <a href="/A071215/b071215.txt">Table of n, a(n) for n = 1..1000</a>
%F A071215 a(n) = omega(prime(n) + prime(n + 1)) = A001221(A001043(n)), where omega is the number of distinct prime factors function.
%e A071215 Prime(6) = 13 and prime(7) = 17. 13 + 17 = 30 = 2 * 3 * 5, which has three distinct prime factors, hence a(6) = 3.
%t A071215 Table[PrimeNu[Prime[n] + Prime[n + 1]], {n, 105}] (* _Jean-François Alcover_, Oct 21 2013 *)
%o A071215 (PARI) A071215(n)=omega(prime(n)+prime(n+1)) \\ _M. F. Hasler_, Jul 23 2007
%Y A071215 Cf. A001043, A001221, A071216, A251609 (greedy inverse).
%K A071215 easy,nonn
%O A071215 1,3
%A A071215 _Labos Elemer_, May 17 2002