Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A074106
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A074106 a(1)=1; a(n) is the minimal unused odd prime such that the sum a(1)+a(2)+...+a(n) is divisible by n. +0
1
1, 3, 5, 7, 19, 13, 29, 11, 47 (list; graph; listen)
OFFSET

1,2

COMMENT

Sequence is finite. The sum of the first 9 terms is 135. For the next term to give a sum that is a multiple of 10, the term must itself be divisible by 5. However, the prime 5 has already been used. - Matthew M. Conroy, Aug 28 2002

LINKS

Matthew M. Conroy, Home page (listed instead of email address)

CROSSREFS

Sequence in context: A112986 A088732 A052333 this_sequence A002261 A079131 A106919

Adjacent sequences: A074103 A074104 A074105 this_sequence A074107 A074108 A074109

KEYWORD

fini,full,nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Aug 22 2002

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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research