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.

A097240 a(n) = (n+1)*prime(n) + n*prime(n+1).

This page as a plain text file.
%I A097240 #12 Jul 31 2022 08:15:22
%S A097240 7,19,41,79,131,193,269,355,491,629,779,973,1133,1303,1547,1845,2099,
%T A097240 2365,2689,2951,3265,3643,4039,4553,5047,5405,5773,6155,6547,7313,
%U A097240 8125,8707,9245,9931,10649,11239,11997,12703,13427,14253,14939,15805,16703
%N A097240 a(n) = (n+1)*prime(n) + n*prime(n+1).
%C A097240 Of the first 10000 terms, 1540 are primes. - _Antti Karttunen_, Jul 30 2022
%H A097240 Antti Karttunen, <a href="/A097240/b097240.txt">Table of n, a(n) for n = 1..10000</a>
%H A097240 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%F A097240 a(n) = A258851(A006094(n)). - _Antti Karttunen_, Jul 30 2022
%t A097240 Table[(n+1)Prime[n]+n*Prime[n+1],{n,50}] (* _Harvey P. Dale_, Oct 02 2017 *)
%o A097240 (PARI) A097240(n) = ((n+1)*prime(n) + n*prime(n+1)); \\ _Antti Karttunen_, Jul 30 2022
%Y A097240 Cf. A000040, A006094, A097241 (primes in this sequence), A258851.
%Y A097240 Column 3 of A356155.
%K A097240 nonn
%O A097240 1,1
%A A097240 _Reinhard Zumkeller_, Aug 02 2004