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 A349660 #46 Mar 18 2022 14:32:02
%S A349660 11,28,54,128,180,302,378,548,864,990,1400,1718,1890,2252,2856,3534,
%T A349660 3780,4550,5108,5400,6314,6968,8004,9498,10298,10710,11552,11988,
%U A349660 12878,16242,17288,18900,19458,22340,22950,24800,26726,28052,30096,32214,32940,36662
%N A349660 Numbers which are the sum of a prime and the square of the next prime.
%H A349660 Karl-Heinz Hofmann, <a href="/A349660/b349660.txt">Table of n, a(n) for n = 1..10000</a>
%F A349660 a(n) = prime(n) + prime(n+1)^2.
%F A349660 a(n) = A000040(n) + A001248(n+1).
%F A349660 a(n) = A036690(n+1) - A001223(n).
%F A349660 a(n) = A001043(n) + A036689(n+1). - _Michel Marcus_, Nov 24 2021
%e A349660 a(2) = 3 + 5^2 = 28; a(3) = 5 + 7^2 = 54.
%t A349660 nterms=100;Table[Prime[n]+Prime[n+1]^2,{n,nterms}] (* _Paolo Xausa_, Nov 24 2021 *)
%o A349660 (Python) from sympy import sieve;
%o A349660 for n in range(1,10001): print(sieve[n] + sieve[n+1]**2)
%o A349660 (PARI) a(n) = prime(n) + prime(n+1)^2; \\ _Michel Marcus_, Nov 24 2021
%Y A349660 Cf. A140511, A000040, A001248, A036690, A001223, A001043, A036689, A349661, A124129.
%K A349660 nonn,easy
%O A349660 1,1
%A A349660 _Karl-Heinz Hofmann_, Nov 24 2021