This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A059583 Each c(i) is "multiply" (*) or "divide" (/); a(n) is number of choices for c(1),..,c(n) so that 1 c(1) 2 c(2) 3 c(3) 5,.., c(n) n-th prime is " remainder = 1 ". 0
 1, 2, 4, 5, 6, 6, 6, 3, 5, 6, 7, 9, 8, 7, 7, 9, 6, 8, 6, 9, 6, 8, 9, 12, 11, 5, 9, 8, 7, 7, 11, 9, 11 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS For n = 4 there are 5 possibilities: 1/2/3/5/7 1/2*3/5*7 1/2*3*5/7 1/2*3*5*7 1*2/3*5*7 LINKS CROSSREFS Sequence in context: A123124 A166236 A291768 * A086370 A083788 A058317 Adjacent sequences:  A059580 A059581 A059582 * A059584 A059585 A059586 KEYWORD nonn AUTHOR Naohiro Nomoto, Feb 17 2001 EXTENSIONS More terms from Sascha Kurz, Oct 16 2001 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.

Last modified July 23 13:49 EDT 2019. Contains 325254 sequences. (Running on oeis4.)