Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A058330
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A058330 a(n) is smallest positive integer, distinct from any terms earlier in the sequence, such that (sum{k=1 to n}[a(k)]) divides (product{k=1 to n}[a(k)])*(sum{k=1 to n}[1/a(k)]). +0
1
1, 2, 4, 3, 7, 602, 292174, 200550, 21353, 14210, 6174, 2744, 8852, 5554, 3494, 7220, 1536, 2520, 1620, 1236, 896, 784, 1764, 140, 2560, 240, 1128, 3240, 1512, 280, 800, 243, 4557, 245, 1579, 666, 135, 2079, 2646, 4650, 250, 1862, 528, 496, 152, 304, 88 (list; graph; listen)
OFFSET

1,2

EXAMPLE

a(4) = 3 because 3 is smallest positive integer m, not = to 1, 2, or 4, where (1 + 2 + 4 + m) divides 1 * 2 * 4 * m * (1 + 1/2 + 1/4 + 1/m).

CROSSREFS

Sequence in context: A090568 A035507 A138612 this_sequence A124256 A108503 A052131

Adjacent sequences: A058327 A058328 A058329 this_sequence A058331 A058332 A058333

KEYWORD

nonn

AUTHOR

Leroy Quet (qq-quet(AT)mindspring.com), Dec 12 2000

EXTENSIONS

More terms from Naohiro Nomoto (6284968128(AT)geocities.co.jp), Jun 26 2001

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 September 5 19:27 EDT 2008. Contains 143485 sequences.


AT&T Labs Research