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.

A229264 Primes in A065387 in the order of their appearance.

This page as a plain text file.
%I A229264 #29 Jan 22 2025 12:42:31
%S A229264 2,19,19,79,103,113,257,523,509,1151,1279,1193,1579,2273,3061,2389,
%T A229264 2693,2843,5003,4831,5119,7411,5693,5623,8623,6323,10139,8933,18401,
%U A229264 14957,20411,20479,21191,20123,29683,28211,36833,55021,57203,68743,48761,66533,62423
%N A229264 Primes in A065387 in the order of their appearance.
%H A229264 Amiram Eldar, <a href="/A229264/b229264.txt">Table of n, a(n) for n = 1..1000</a>
%e A229264 Third term of A038344 is 9 and sigma(9) + phi(9) = 13 + 6 = 19 is prime.
%p A229264 with(numtheory); P:=proc(q) local a, n; for n from 1 to q do a:=sigma(n)+phi(n);
%p A229264 if isprime(a) then print(a); fi; od; end: P(10^6);
%t A229264 Select[Table[DivisorSigma[1,n]+EulerPhi[n],{n,30000}],PrimeQ] (* _Harvey P. Dale_, Apr 30 2018 *)
%o A229264 (PARI) lista(kmax) = {my(f, s); for(k = 1, kmax, f = factor(k); s= sigma(f) + eulerphi(f); if(isprime(s), print1(s, ", ")));} \\ _Amiram Eldar_, Nov 19 2024
%Y A229264 Cf. A000005, A000010, A000203, A009087, A023194, A038344, A055813, A062700, A064205, A065387, A115919, A141242, A229265, A229266, A229267, A229268.
%K A229264 nonn
%O A229264 1,1
%A A229264 _Paolo P. Lava_, Sep 18 2013
%E A229264 Name corrected by _Amiram Eldar_, Nov 19 2024