STATUS
proposed
approved
The OEIS is supported by the many generous donors to the OEIS Foundation.
Revision History for A373233
(Bold, blue-underlined text is an addition; faded, red-underlined text is aShowing all changes.
Relative of Hofstadter Q-sequence: a(n) = 0 for n <= 0, a(n) = n for 1 <= n <= 13; a(n) = a(n-a(n-1)) + a(n-a(n-2)) + a(n-a(n-3)) for n > 13.
(history; published version)
(history; published version)
STATUS
editing
proposed
MATHEMATICA
a[n_] := a[n] = Which[n < 1, 0, n < 14, n, True, a[n-a[n-1]] + a[n-a[n-2]] + a[n-a[n-3]]]; Array[a, 100] (* Paolo Xausa, May 31 2024 *)
STATUS
approved
editing
LINKS
Nathan Fox, <a href="/A373233/b373233_1.txt">Table of n, a(n) for n = 1..10000</a>
STATUS
proposed
approved
STATUS
editing
proposed
DATA
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 6, 14, 15, 16, 9, 17, 18, 19, 12, 20, 21, 22, 15, 23, 24, 17, 26, 18, 26, 28, 29, 22, 21, 37, 32, 18, 23, 38, 42, 24, 26, 39, 37, 37, 31, 33, 46, 32, 41, 38, 40, 36, 42, 49, 36, 46, 38, 56, 42, 48, 35, 62, 31, 52, 58, 59, 32, 43, 53, 82, 37, 44, 44, 79, 58, 41, 31, 89, 70, 54, 32, 70, 81, 58, 42, 63, 80, 68, 50, 59, 63, 86, 75, 52, 69, 84, 64
STATUS
proposed
editing
STATUS
editing
proposed
NAME
allocated Relative of Hofstadter Q-sequence: a(n) = 0 for n <= 0, a(n) = n for 1 <= n <= 13; a(n) = a(n-a(n-1)) + a(n-a(n-2)) + a(n-a(n-3)) for Nathan Foxn > 13.
DATA
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 6, 14, 15, 16, 9, 17, 18, 19, 12, 20, 21, 22, 15, 23, 24, 17, 26, 18, 26, 28, 29, 22, 21, 37, 32, 18, 23, 38, 42, 24, 26, 39, 37, 37, 31, 33, 46, 32, 41, 38, 40, 36, 42, 49, 36, 46, 38, 56, 42, 48, 35, 62, 31, 52, 58, 59, 32, 43, 53, 82, 37, 44, 44, 79, 58, 41, 31, 89, 70, 54, 32, 70, 81, 58, 42, 63, 80, 68, 50, 59, 63, 86, 75, 52, 69, 84, 64
OFFSET
1,2
COMMENTS
Similar to A278055 but with different starting values.
a(73) = 82. This is the smallest index for which a(n) > n. So, without the condition that a(n) = 0 for n <= 0, this sequence would be finite and have exactly 73 terms.
Much like the Hofstadter Q-sequence A005185, it is not known if this sequence is defined for all positive n.
a(n) exists for n <= 3*10^7.
LINKS
Nathan Fox, <a href="/A373233/b373233_1.txt">Table of n, a(n) for n = 1..10000</a>
CROSSREFS
KEYWORD
allocated
nonn
AUTHOR
Nathan Fox, May 28 2024
STATUS
approved
editing
NAME
allocated for Nathan Fox
KEYWORD
allocated
STATUS
approved