|
Search: id:A131971
|
|
|
| A131971 |
|
a(0) = a(1) = a(2) = 1; a(n) = (a(n-1) + a(n-2) + a(n-3)) mod n. |
|
+0
1
|
|
| 1, 1, 1, 0, 2, 3, 5, 3, 3, 2, 8, 2, 0, 10, 12, 7, 13, 15, 17, 7, 19, 1, 5, 2, 8, 15, 25, 21, 5, 22, 18, 14, 22, 21, 23, 31, 3, 20, 16, 0, 36, 11, 5, 9, 25, 39, 27, 44, 14, 36, 44, 43, 19, 0, 8, 27, 35, 13, 17, 6, 36, 59, 39, 8, 42, 24, 8, 7, 39, 54, 30
(list; graph; listen)
|
|
|
OFFSET
|
0,5
|
|
|
COMMENT
|
Tribonacci (A000213) analogue of A096535. The analogous 3 Klaus Brockhaus conjectures are applicable: (1) All numbers appear infinitely often, i.e. for every number k >= 0 and every frequency f > 0 there is an index i such that a(i) = k is the f-th occurrence of k in the sequence. (2) a(j) = a(j-1) + a(j-2) + a(j-3) and a(j) = a(j-1) + a(j-2) + a(j-3) - j occur approximately equally often, i.e. lim {n -> infinity} x_n / y_n = 1, where x_n is the number of j <= n such that a(j) = a(j-1) + a(j-2) + a(j-3) and y_n is the number of j <= n such that a(j) = a(j-1) + a(j-2) + a(j-3) - j (cf. A122276). (3) There are sections a(g+1), ..., a(g+k) of arbitrary length k such that a(g+h) = a(g+h-1) + a(g+h-2) + a(g+h-3) for h = 1,...,k, i.e. the sequence is non-decreasing in these sections (cf. A122277, A122278, A122279).
|
|
CROSSREFS
|
Cf. A000213, A096535.
Sequence in context: A069110 A123221 A072751 this_sequence A100742 A001269 A077276
Adjacent sequences: A131968 A131969 A131970 this_sequence A131972 A131973 A131974
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Jonathan Vos Post (jvospost3(AT)gmail.com), Oct 05 2007
|
|
|
Search completed in 0.002 seconds
|
