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!)
A094252 a(n) = partition(n) mod prime(n). 3
1, 2, 3, 5, 7, 11, 15, 3, 7, 13, 25, 3, 19, 6, 35, 19, 2, 19, 21, 59, 62, 54, 10, 62, 18, 12, 23, 80, 96, 67, 111, 96, 5, 78, 132, 8, 128, 98, 123, 143, 12, 141, 40, 98, 90, 88, 53, 93, 97, 187, 186, 47, 2, 117, 241, 34, 27, 51, 266, 108, 259, 115, 278, 30, 281, 227, 244, 141 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Indices n such that a(n)=0 (i.e., prime(n) divides partition(n)) are listed in A245662. - Max Alekseyev, Jul 27 2014
LINKS
EXAMPLE
a(10) = 13: partition(10) = 42, prime(10) = 29. 42 mod 29 = 13.
MATHEMATICA
Table[ Mod[ PartitionsP[n], Prime[n]], {n, 70}] (* Robert G. Wilson v, Apr 28 2004 *)
CROSSREFS
Sequence in context: A359683 A184642 A350836 * A209038 A182803 A106532
KEYWORD
nonn
AUTHOR
Gary W. Adamson, Apr 25 2004
EXTENSIONS
Edited by Robert G. Wilson v, Apr 28 2004
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 April 18 06:24 EDT 2024. Contains 371769 sequences. (Running on oeis4.)