Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A079032
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A079032 Smallest nontrivial partition number divisible by the n-th partition number. +0
1
2, 22, 15, 15, 42, 22, 30, 176, 133230930, 2436, 8118264, 231, 413766180933342362, 31185, 118114304, 31185, 31185, 31185, 670448123060170, 426088638015652413417, 1973678121921532286407950000, 133230930 (list; graph; listen)
OFFSET

1,1

EXAMPLE

a(5)=42 because the 5th partition number is 7 and the next partition number divisible by 7 is 42.

MAPLE

with(combinat): a:=proc(n) local S, j: S:={}: for j from n+1 to 800 do if type(numbpart(j)/numbpart(n), integer)=true then S:=S union {numbpart(j)} else S:=S fi: od: min(seq(S[i], i=1..nops(S))): end: seq(a(n), n=1..25); - Emeric Deutsch (deutsch(AT)duke.poly.edu), May 16 2006

PROGRAM

(PARI) a(n)=if(n<0, 0, s=n+1; while(polcoeff(1/eta(x), s)%polcoeff(1/eta(x), n)>0, s++); polcoeff(1/eta(x), s))

CROSSREFS

Cf. A000041.

Adjacent sequences: A079029 A079030 A079031 this_sequence A079033 A079034 A079035

Sequence in context: A077526 A083764 A141236 this_sequence A080283 A080433 A022373

KEYWORD

more,nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Feb 01 2003

EXTENSIONS

More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), May 16 2006

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 11 09:12 EDT 2008. Contains 144832 sequences.


AT&T Labs Research