login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A094252 a(n) = partition(n) mod prime(n). 0
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; internal format)
OFFSET

1,2

EXAMPLE

a(10) = 13: partition(10) = 42, prime(10) = 29. 42 mod 29 = 13.

MATHEMATICA

Table[ Mod[ PartitionsP[n], Prime[n]], {n, 70}] (from Robert G. Wilson v Apr 28 2004)

CROSSREFS

Cf. A000041, A093952.

Sequence in context: A036006 A027341 A184642 * A182803 A106532 A090693

Adjacent sequences:  A094249 A094250 A094251 * A094253 A094254 A094255

KEYWORD

nonn

AUTHOR

Gary W. Adamson (qntmpkt(AT)yahoo.com), Apr 25 2004

EXTENSIONS

Edited by Robert G. Wilson v (rgwv(AT)rgwv.com), Apr 28 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 12:41 EST 2012. Contains 205909 sequences.