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.

A022460 a(n) = prime(3*n) mod prime(n).

This page as a plain text file.
%I A022460 #19 Sep 08 2022 08:44:46
%S A022460 1,1,3,2,3,9,5,13,11,26,13,3,3,9,9,11,56,7,1,68,15,1,15,3,88,94,7,5,
%T A022460 13,11,106,110,112,1,124,140,136,130,142,140,140,158,154,164,170,190,
%U A022460 178,158,172,176,184,194,214,200,206,208,212,220,220,226,244
%N A022460 a(n) = prime(3*n) mod prime(n).
%H A022460 G. C. Greubel, <a href="/A022460/b022460.txt">Table of n, a(n) for n = 1..10000</a>
%F A022460 a(n) = A031336(n) modulo A000040(n). - _Michel Marcus_, Sep 30 2013
%t A022460 Table[Mod[Prime[3 n], Prime[n]], {n, 100}] (* _Vincenzo Librandi_, Dec 09 2014 *)
%o A022460 (PARI) a(n) = prime(3*n) % prime(n); \\ _Michel Marcus_, Sep 30 2013
%o A022460 (Magma) [NthPrime(3*n) mod NthPrime(n): n in [1..90]]; // _Vincenzo Librandi_, Dec 09 2014
%K A022460 nonn
%O A022460 1,3
%A A022460 _Clark Kimberling_