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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A046641 a(n) is the smallest positive integer m such that the number of partitions p(m)=A000041(m) is divisible by n. 7
1, 2, 3, 11, 4, 9, 5, 11, 14, 9, 6, 21, 28, 10, 7, 15, 54, 21, 20, 58, 10, 8, 32, 21, 24, 28, 14, 11, 26, 9, 44, 66, 16, 94, 18, 21, 86, 47, 129, 66, 35, 10, 27, 15, 14, 75, 56, 70, 19, 74, 178, 62, 52, 340, 18, 11, 20, 26, 54, 124, 115, 101, 24, 66, 84, 21, 47, 94, 32, 19 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

The initial term could also be taken to be 0.

LINKS

M. F. Hasler, Table of n, a(n) for n=1,...,20000.

M. F. Hasler, A046641.c - C program for fast computation of a(n) for large values of n. [From M. F. Hasler (www.univ-ag.fr/~mhasler), Oct 18 2008]

CROSSREFS

Cf. A000041, A040051.

See A091690 for simple PARI code, A145523(n)=a(2^n), A145524(n)=a(10^n), A145771 for record values. [From M. F. Hasler (www.univ-ag.fr/~mhasler), Oct 18 2008]

Sequence in context: A111788 A098929 A073098 * A083664 A083125 A031335

Adjacent sequences:  A046638 A046639 A046640 * A046642 A046643 A046644

KEYWORD

nonn

AUTHOR

David W. Wilson (davidwwilson(AT)comcast.net)

EXTENSIONS

Definition corrected by Max Alekseyev (maxale(AT)gmail.com), Apr 25 2010

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 15 05:45 EST 2012. Contains 205694 sequences.