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!)
A244797 Number of moduli m such that (prime(n) mod m) = 2. 4
0, 0, 1, 1, 2, 1, 3, 1, 3, 3, 1, 3, 3, 1, 5, 3, 3, 1, 3, 3, 1, 3, 4, 3, 3, 5, 1, 7, 1, 3, 3, 3, 7, 1, 5, 1, 3, 3, 7, 5, 3, 1, 7, 1, 7, 1, 3, 3, 8, 1, 7, 3, 1, 3, 7, 5, 3, 1, 5, 5, 1, 3, 3, 3, 1, 11, 3, 3, 7, 1, 7, 7, 3, 3, 3, 3, 5, 3, 7, 3, 3, 1, 7, 1, 3, 8 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,5

COMMENTS

Except for the initial 0,0, this is column 2 of the array at A244740.

LINKS

Clark Kimberling, Table of n, a(n) for n = 1..1000

EXAMPLE

prime(5) = 11 = (2 mod m) for m = 3, 9 so that a(5) = 2.

MATHEMATICA

z = 300; f[n_, m_] := If[Mod[Prime[n], m] == 2, 1, 0];

t = Table[f[n, m], {n, 1, z}, {m, 1, Prime[n]}];

Table[Count[t[[k]], 1], {k, 1, z}] (* A244797 *)

CROSSREFS

Cf. A244740, A244796, A244798.

Sequence in context: A048864 A003139 A349918 * A308659 A145652 A111248

Adjacent sequences:  A244794 A244795 A244796 * A244798 A244799 A244800

KEYWORD

nonn,easy

AUTHOR

Clark Kimberling, Jul 06 2014

STATUS

approved

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 June 27 22:08 EDT 2022. Contains 354898 sequences. (Running on oeis4.)