cp's OEIS Frontend

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.

A299644 a(n) = prime(prime(n+1)) + prime(prime(n)).

This page as a plain text file.
%I A299644 #15 Sep 08 2022 08:46:20
%S A299644 8,16,28,48,72,100,126,150,192,236,284,336,370,402,452,518,560,614,
%T A299644 684,720,768,832,892,970,1056,1110,1150,1186,1216,1326,1448,1512,1570,
%U A299644 1656,1736,1796,1886,1958,2022,2094,2150,2240,2324,2372,2418,2514,2706,2842,2880,2918
%N A299644 a(n) = prime(prime(n+1)) + prime(prime(n)).
%C A299644 All terms are even. - _Michel Marcus_, Mar 20 2018
%F A299644 a(n) = A006450(n+1) + A006450(n).
%t A299644 Table[Prime[Prime[n + 1]] + Prime[Prime[n]], {n, 1, 50}]
%o A299644 (Magma) [NthPrime(NthPrime(n+1))+NthPrime(NthPrime(n)):n in [1..50]];
%o A299644 (PARI) a(n) = prime(prime(n+1)) + prime(prime(n)); \\ _Michel Marcus_, Mar 20 2018
%Y A299644 Cf. A000040, A006450, A073131.
%K A299644 nonn
%O A299644 1,1
%A A299644 _Vincenzo Librandi_, Mar 20 2018