login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A091690 Smallest integer m such that the n-th prime A000040(n) divides partition number A000041(m). 3
2, 3, 4, 5, 6, 28, 54, 20, 32, 26, 44, 86, 35, 27, 56, 52, 54, 115, 47, 43, 46, 123, 29, 25, 44, 13, 78, 96, 320, 63, 40, 73, 66, 60, 333, 203, 116, 960, 22, 79, 368, 310, 75, 41, 118, 59, 100, 64, 55, 115, 316, 353, 46, 23, 197, 236, 193, 871, 179, 37, 95, 183, 233 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

See A091689 for comment, links and example: A091689(n)=A000041(a(n)).

LINKS

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

FORMULA

a(n) = A046641(A000040(n)). - M. F. Hasler, Oct 20 2008

PROG

(PARI) forprime(p=2, 400, n=2:while(numbpart(n)%p, n=n+1):print1(n", "))

(sh) i=2; c=1; while [ $i -le 20000 ]; do if [ `factor $i | wc -w` = 2 ]; then awk '/^'$i' / {print "'$c' " $2; exit}' b046641.txt; let c+=1; if [ $i = 2 ]; then i=1; fi; fi; let i+=2; done # M. F. Hasler, Oct 20 2008

CROSSREFS

Sequence in context: A246908 A303367 A037332 * A024640 A037403 A037439

Adjacent sequences:  A091687 A091688 A091689 * A091691 A091692 A091693

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller, Jan 29 2004

EXTENSIONS

Corrected by Ralf Stephan, Jul 27 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 27 12:08 EDT 2021. Contains 348276 sequences. (Running on oeis4.)