login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A082974 a(n) = a(n-1) + p(n) mod p(n+1). 1
2, 0, 5, 1, 12, 8, 6, 2, 25, 23, 17, 13, 11, 7, 1, 54, 52, 46, 42, 40, 34, 30, 24, 16, 12, 10, 6, 4, 0, 113, 109, 103, 101, 91, 89, 83, 77, 73, 67, 61, 59, 49, 47, 43, 41, 29, 17, 13, 11, 7, 1, 240, 230, 224, 218, 212, 210, 204, 200, 198, 188, 174, 170, 168, 164, 150, 144, 134 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

Differences when decreasing are essentially A001223, so increases occur when primes being used are roughly double those at previous increase; e.g. a(3352)=(12+31123)mod 31139=31135 and a(6257)=(1+62273)mod 62297=62274 - Henry Bottomley (se16(AT)btinternet.com), Jul 13 2003

EXAMPLE

a(4)=(((2%3 + 3)%5 + 5)%7 + 7)%11 = (((2+3)%5+5)%7+7)%11

= (((0+5)%7+7)%11 = (5+7)%11 = 1

PROG

(PARI) ps=0; pc=1; while (pc<100, ps+=prime(pc); ps%=prime(pc++); print1(ps", "))

CROSSREFS

Cf. A000040, A001223, A071089.

Sequence in context: A188449 A188445 A198926 * A167635 A192426 A075603

Adjacent sequences:  A082971 A082972 A082973 * A082975 A082976 A082977

KEYWORD

nonn

AUTHOR

Jon Perry (perry(AT)globalnet.co.uk), May 28 2003

EXTENSIONS

Edited by Henry Bottomley (se16(AT)btinternet.com), Jul 13 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 19:03 EST 2012. Contains 205940 sequences.