login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A076591 a(1)=1, a(2)=2 a(n)=a(n-1)+(a(n-2) mod n). 0
1, 2, 3, 5, 8, 13, 14, 19, 24, 33, 35, 44, 53, 55, 63, 70, 82, 98, 104, 122, 142, 154, 158, 168, 176, 188, 202, 222, 250, 262, 264, 270, 270, 302, 327, 341, 372, 409, 430, 439, 459, 478, 507, 545, 557, 596, 636, 656, 704, 710, 751, 785, 794, 823, 847, 886, 935 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..57.

FORMULA

(4*a(n)-n^2)/n^(3/2) is bounded

MATHEMATICA

RecurrenceTable[{a[1]==1, a[2]==2, a[n]==a[n-1]+Mod[a[n-2], n]}, a, {n, 60}] (* Harvey P. Dale, Apr 28 2016 *)

CROSSREFS

Sequence in context: A010076 A182444 A138183 * A078695 A121367 A308495

Adjacent sequences:  A076588 A076589 A076590 * A076592 A076593 A076594

KEYWORD

nonn

AUTHOR

Benoit Cloitre, Nov 10 2002

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 15 02:19 EDT 2021. Contains 345042 sequences. (Running on oeis4.)