login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A074972 a(n) == - prime(n) (modulo 20). 0

%I #4 Mar 30 2012 17:34:13

%S 18,17,15,13,9,7,3,1,17,11,9,3,19,17,13,7,1,19,13,9,7,1,17,11,3,19,17,

%T 13,11,7,13,9,3,1,11,9,3,17,13,7,1,19,9,7,3,1,9,17,13,11,7,1,19,9,3,

%U 17,11,9,3,19,17,7,13,9,7,3,9,3,13,11,7,1,13,7,1,17,11,3,19,11,1,19,9,7,1

%N a(n) == - prime(n) (modulo 20).

%t Table[ Mod[ -Prime[n], 20], {n, 1, 85} ]

%K nonn

%O 1,1

%A _Roger L. Bagula_, Oct 05 2002

%E Edited and extended by _Robert G. Wilson v_, Oct 07 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 10 20:32 EDT 2024. Contains 372388 sequences. (Running on oeis4.)