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 A098037 #22 Jan 20 2025 05:30:55 %S A098037 1,3,3,3,4,3,4,3,3,4,3,3,4,4,4,5,5,7,3,6,4,5,3,3,4,4,4,6,3,6,3,3,4,7, %T A098037 5,4,7,4,4,6,6,4,8,4,5,3,3,5,5,4,4,7,4,3,5,4,6,3,4,4,8,6,3,6,5,7,3,5, %U A098037 5,5,4,4,4,5,3,3,3,4,6,5,6,4,8,4,5,3,3,5,5,4,3,4,3,5,3,4,3,5,5,7,6,7,3,5,4 %N A098037 Number of prime divisors, counted with multiplicity, of the sum of two consecutive primes. %C A098037 Clearly sum of two consecutive primes prime(x) and prime(x+1) has more than 2 prime divisors for all x > 1. %H A098037 Amiram Eldar, <a href="/A098037/b098037.txt">Table of n, a(n) for n = 1..10000</a> %F A098037 a(n) = A001222(A001043(n)). - _Michel Marcus_, Feb 15 2014 %e A098037 Prime(2) + prime(3) = 2*2*2, 3 factors, the second term in the sequence. %p A098037 A098037 := proc(n) %p A098037 ithprime(n)+ithprime(n+1) ; %p A098037 numtheory[bigomega](%) ; %p A098037 end proc: %p A098037 seq(A098037(n),n=1..40) ; # _R. J. Mathar_, Jan 20 2025 %t A098037 PrimeOmega[Total[#]]&/@Partition[Prime[Range[110]],2,1] (* _Harvey P. Dale_, Jun 14 2011 *) %o A098037 (PARI) b(n) = for(x=1,n,y1=(prime(x)+prime(x+1));print1(bigomega(y1)",")) %Y A098037 Cf. A071215, A251600 (greedy inverse). %K A098037 easy,nonn %O A098037 1,2 %A A098037 _Cino Hilliard_, Sep 10 2004 %E A098037 Definition corrected by _Andrew S. Plewe_, Apr 08 2007