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.

A163750 a(n) = (n-th even nonprime mod n-th prime).

This page as a plain text file.
%I A163750 #8 Aug 03 2017 03:07:47
%S A163750 0,1,1,1,10,12,14,16,18,20,22,24,26,28,30,32,34,36,38,40,42,44,46,48,
%T A163750 50,52,54,56,58,60,62,64,66,68,70,72,74,76,78,80,82,84,86,88,90,92,94,
%U A163750 96,98,100,102,104,106,108,110,112,114,116,118,120,122,124,126,128,130,132
%N A163750 a(n) = (n-th even nonprime mod n-th prime).
%H A163750 G. C. Greubel, <a href="/A163750/b163750.txt">Table of n, a(n) for n = 1..5000</a>
%F A163750 a(n) = (A163300(n) mod A000040(n)).
%p A163750 A163300 := proc(n) if n = 1 then 0; else for a from procname(n-1)+2 by 2 do if not isprime(a) then return(a) ; end if; end do: end if; end proc: A163750 := proc(n) A163300(n) mod ithprime(n) ; end proc: seq(A163750(n),n=1..120) ; # _R. J. Mathar_, Oct 10 2009
%t A163750 A087156[n_] := Mod[n, DivisorSigma[1, n]]; Table[Mod[2*A087156[n], Prime[n]], {n, 1, 50}] (* _G. C. Greubel_, Aug 02 2017 *)
%Y A163750 Cf. A000040, A163300.
%K A163750 nonn
%O A163750 1,5
%A A163750 _Juri-Stepan Gerasimov_, Aug 03 2009