Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A111702
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A111702 a(1) = 3, then n multiples of n so that every partial sum is a prime. +0
2
3, 2, 2, 6, 6, 12, 12, 4, 12, 8, 30, 10, 20, 10, 20, 6, 18, 12, 6, 12, 12, 28, 42, 14, 42, 70, 14, 28, 48, 32, 16, 56, 40, 8, 16, 24, 18, 54, 36, 18, 36, 18, 72, 18, 90, 30, 60, 20, 10, 20, 30, 60, 10, 20, 40, 66, 44, 22, 66, 110, 132, 22, 44, 22, 44, 66, 12, 72, 48, 12, 36, 24, 36 (list; graph; listen)
OFFSET

1,1

CROSSREFS

Cf. A111703.

Sequence in context: A093055 A106335 A065474 this_sequence A091029 A089327 A091264

Adjacent sequences: A111699 A111700 A111701 this_sequence A111703 A111704 A111705

KEYWORD

easy,nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Aug 21 2005

EXTENSIONS

Corrected and extended by Joshua Zucker (joshua.zucker(AT)stanfordalumni.org), May 08 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 December 20 00:58 EST 2009. Contains 171054 sequences.


AT&T Labs Research