Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A061120
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A061120 Compute sum of divisors of the p(n+1)-p(n)-1 composite numbers between two consecutive primes; choose the smallest. +0
2
7, 12, 13, 28, 24, 39, 32, 31, 72, 48, 56, 96, 72, 57, 72, 168, 84, 96, 195, 96, 121, 108, 112, 156, 216, 162, 280, 152, 133, 176, 160, 288, 168, 372, 192, 192, 252, 183, 240, 546, 216, 508, 294, 468, 240, 252, 342, 560, 384, 288, 744, 280, 288, 304, 324, 720 (list; graph; listen)
OFFSET

0,1

LINKS

Harry J. Smith, Table of n, a(n) for n=0,...,1000

FORMULA

a(n)=Min{sigma(c); p(n+1)>c>p(n)}, c is composite, p(n) is the n-th prime and sigma=A000203()

PROGRAM

(PARI) { n=-1; q=3; m=10^6; forprime (p=5, prime(1003), a=m; for (i=q + 1, p - 1, a=min(sigma(i), a)); q=p; write("b061120.txt", n++, " ", a) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jul 18 2009]

CROSSREFS

A000203, A061141.

Sequence in context: A083681 A048653 A075696 this_sequence A078835 A031021 A153245

Adjacent sequences: A061117 A061118 A061119 this_sequence A061121 A061122 A061123

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), May 29 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 December 21 10:15 EST 2009. Contains 171081 sequences.


AT&T Labs Research