Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A076591
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A076591 a(1)=1, a(2)=2 a(n)=a(n-1)+(a(n-2) mod n). +0
1
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; listen)
OFFSET

1,2

FORMULA

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

CROSSREFS

Adjacent sequences: A076588 A076589 A076590 this_sequence A076592 A076593 A076594

Sequence in context: A069638 A010076 A138183 this_sequence A078695 A121367 A070217

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Nov 10 2002

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 May 16 01:24 EDT 2008. Contains 139630 sequences.


AT&T Labs Research