login
A084451
Juggling states associated with the juggling sequence A084452.
6
7, 11, 13, 14, 7, 19, 25, 28, 14, 7, 35, 21, 26, 13, 22, 11, 37, 50, 25, 44, 22, 11, 69, 38, 19, 41, 52, 26, 13, 70, 35, 49, 56, 28, 14, 7, 67, 97, 112, 56, 28, 14, 7, 131, 73, 100, 50, 25, 76, 38, 19, 137, 84, 42, 21, 74, 37, 82, 41, 148, 74, 37, 146, 73, 164, 82, 41, 276
OFFSET
0,1
COMMENTS
Start with a(0) = 7, and then set a(n+1) = a(n)/2 if a(n) is even, otherwise a(n+1) = (a(n)-1)/2 + 2^e for the smallest e such that a(n+1) has no earlier occurrence in the sequence and is a term of A014311. - Antti Karttunen, Apr 17 2026
FORMULA
a(0)=7, a(n) = (a(n-1) + 2^A084452(n) - 1)/2.
EXAMPLE
a(0) = 7 by definition.
a(1) = (a(0)-1)/2 + 2^e = 3 + 2^e, but e=0 or 1 cannot be used as 4 and 5 have less than three 1-bits, while e=2 cannot be used because 3+4 = 7 is already present in the sequence, so the next smallest e is 3, thus a(1) = 3 + 2^3 = 11.
a(2) = (a(1)-1)/2 + 2^e = 5 + 2^e, but e=0 cannot be used as 6 has less than three 1-bits, while e=1 cannot be used because 5+2 = 7 is already present in the sequence, so the next smallest e is 3, thus a(2) = 5 + 2^3 = 13.
a(3) = (a(2)-1)/2 + 2^e = 6 + 2^e, but e=0 cannot be used as 6+1 = 7 has already occurred in the sequence, and with e=1..2 the sum has less than three 1-bits, so the next smallest e is 3, thus a(3) = 6 + 2^3 = 14.
a(4) = a(3)/2 = 7. Note that now the previously occurring 7 is allowed, because it is a result of dividing the previous term (that is even) by two.
CROSSREFS
Cf. A084449 (positions of sevens, i.e., ground states), A084450 (this sequence in binary), A084452.
Cf. A395048 (odd terms), A395048 (their indices in this sequence).
Only terms of A014311 occur here.
Cf. A084457 for a completely injective variant.
Sequence in context: A206546 A275516 A392667 * A091901 A072823 A110547
KEYWORD
nonn,base
AUTHOR
Antti Karttunen, Jun 02 2003
EXTENSIONS
Example section added by Antti Karttunen, Apr 17 2026
STATUS
approved