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.

A074879 10 - Mod(prime(n),10) when prime(n) + 22 = prime(n+1).

This page as a plain text file.
%I A074879 #20 Mar 17 2023 07:27:55
%S A074879 1,9,9,3,1,1,1,3,3,1,3,1,3,1,1,3,1,9,1,3,1,3,1,9,1,3,9,3,9,3,3,1,9,3,
%T A074879 1,1,3,9,9,3,3,1,1,3,9,9,1,1,3,3,1,3,3,1,1,1,9,9,1,1,9,3,1,9,1,3,1,1,
%U A074879 9,1,1,1,3,1,3,9,9,1,1,1,1,1,3,1,1,1,3,1,9,9,1,3,9,1,3,1,9,3,1,9,9,9,1,1,1
%N A074879 10 - Mod(prime(n),10) when prime(n) + 22 = prime(n+1).
%t A074879 10 - Mod[ Prime[ Select[ Range[5220], Prime[ # ] + 22 == Prime[ # + 1] & ]], 10]
%t A074879 10-Mod[#,10]&/@Transpose[Select[Partition[Prime[Range[6000]],2,1], Last[#]- First[#]==22&]][[1]] (* _Harvey P. Dale_, Apr 12 2011 *)
%o A074879 (Magma) [10-(n mod 10): n in PrimesUpTo(50000) | n+22 eq NextPrime(n)];  // _Bruno Berselli_, Apr 12 2011
%Y A074879 Cf. A072003, A061779.
%K A074879 nonn,less
%O A074879 1,2
%A A074879 _Roger L. Bagula_, Sep 30 2002
%E A074879 Edited by _Robert G. Wilson v_ and _N. J. A. Sloane_, Oct 03 2002