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

1,5

COMMENTS

Except for the initial 0, 0, 0, this is column 3 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] == 3, 1, 0];

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

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

CROSSREFS

Cf. A244740, A244796, A244797.

Sequence in context: A328576 A052275 A338139 * A308253 A286614 A023508

Adjacent sequences:  A244795 A244796 A244797 * A244799 A244800 A244801

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 29 04:23 EDT 2022. Contains 354907 sequences. (Running on oeis4.)