Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A134126
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A134126 Indices associated with A134125: cumulative prime sums producing integral quotients when divided by the running index of the count. +0
6
1, 2, 4, 7, 10, 50, 130, 328, 651, 4938, 7492, 8083, 12045, 33170, 43138, 61690, 151496, 265056, 953959, 1971358 (list; graph; listen)
OFFSET

1,2

COMMENT

See A134125 and other cross-references.

FORMULA

Count from first instance, 2+3=5 (1st count), to second instance: 5 sum added to next prime 5 = 10 (2nd count), etc. The count is maintained whether or not a sum divided by the index is integral.

EXAMPLE

This sequence procedes with count of 1,2,3,4,5,6,7,8,. . . . But counts 3,5,6,8 do not produce integral quotients so do not appear in the sequence.

PROGRAM

UBASIC: 10 'primes using counters 20 N=3:C=1:R=5:print 2; 3, 5 30 A=3:S=sqrt(N) 40 B=N\A 50 if B*A=N then N=N+2:goto 30 60 A=A+2:O=A 70 if A<=sqrt(N) then 40 80 C=C+1 90 R=R+N:T=R/C:U=R-N 100 if T=int(T) then print C; U; N; R; T:stop 110 N=N+2:goto 30

CROSSREFS

Cf. A134125 A134127 A134128 A134129.

Sequence in context: A036685 A034744 A121352 this_sequence A091263 A101430 A140794

Adjacent sequences: A134123 A134124 A134125 this_sequence A134127 A134128 A134129

KEYWORD

easy,more,nonn,uned

AUTHOR

Enoch Haga (Enokh(AT)comcast.net), Oct 09 2007

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 4 21:35 EST 2008. Contains 151309 sequences.


AT&T Labs Research