Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A104647
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A104647 a(n) = a(n-1) mod n + a(n-2) mod n; a(0) = 0, a(1) = 1. +0
7
0, 1, 1, 2, 3, 5, 8, 6, 6, 12, 8, 9, 17, 13, 16, 14, 14, 28, 24, 14, 18, 32, 28, 14, 18, 32, 24, 29, 25, 25, 50, 44, 30, 41, 37, 8, 9, 17, 26, 43, 29, 31, 60, 48, 20, 23, 43, 66, 61, 29, 40, 69, 57, 20, 23, 43, 66, 52, 60, 53, 53, 106, 97, 77, 46, 58, 104, 95, 63, 89, 82, 29, 39, 68 (list; graph; listen)
OFFSET

0,4

COMMENT

a(n) <= a(n-1) + a(n-2) < 2*n for n>0, see A105859 for numbers i such that a(i)=a(i-1)+a(i-2) and A105860 for numbers j with a(j)<a(j-1)+a(j-2); - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 23 2005

A105855 = (first differences) and A105856 = (partial sums); records occur at A105857: A105858(n) = a(A105857(n)). - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 23 2005

CROSSREFS

Sequence in context: A105836 A105822 A011158 this_sequence A065115 A010075 A010074

Adjacent sequences: A104644 A104645 A104646 this_sequence A104648 A104649 A104650

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 21 2005

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 10 12:09 EST 2009. Contains 170569 sequences.


AT&T Labs Research