Sequences
392,541 sequences
- Permutation of Z, obtained by reflecting the juggling sequence A084458 from positive to negative numbers (with zero thrown at beat 0), folded to N with functions N2Z and Z2N.A084461
Permutation of Z, obtained by reflecting the juggling sequence A084458 from positive to negative numbers (with zero thrown at beat 0), folded to N with functions N2Z and Z2N.
- Inverse permutation to A084461.A084462
Inverse permutation to A084461.
- Positions of even juggling states in A084457, i.e., positions of zeros in A084458 - 1.A084463
Positions of even juggling states in A084457, i.e., positions of zeros in A084458 - 1.
- Positions of odd juggling states in A084457, i.e., positions of nonzero-throws in A084458 - 1.A084464
Positions of odd juggling states in A084457, i.e., positions of nonzero-throws in A084458 - 1.
- First differences of A084449.A084465
First differences of A084449.
- Inverse permutation to A084455.A084466
Inverse permutation to A084455.
- Odd terms of A084457.A084467
Odd terms of A084457.
- Odd numbers with exactly 3 ones in binary expansion.A084468
Odd numbers with exactly 3 ones in binary expansion.
- Position of A084467(n) in A084468(n).A084469
Position of A084467(n) in A084468(n).
- Position of A084468(n) in A084467(n).A084470
Position of A084468(n) in A084467(n).
- Change 0 to 00 in binary representation of n.A084471
Change 0 to 00 in binary representation of n.
- Write n in binary and replace 0 with 00.A084472
Write n in binary and replace 0 with 00.
- Replace 0 with 0000 in binary representation of n.A084473
Replace 0 with 0000 in binary representation of n.
- Write n in binary and replace 0 with 0000.A084474
Write n in binary and replace 0 with 0000.
- a(n) defines the first brilliant number, b_n, greater than 10^n. If n is odd or zero, then b_n is 10^n+a(n); and if n is a positive even number, then b_n is {10^(n/2)+a(n)}^2.A084475
a(n) defines the first brilliant number, b_n, greater than 10^n. If n is odd or zero, then b_n is 10^n+a(n); and if n is a positive even number, then b_n is {10^(n/2)+a(n)}^2.
- Least k such that 10^(2n-1)+k is a brilliant number.A084476
Least k such that 10^(2n-1)+k is a brilliant number.
- Number of fault-free tilings of a 4 X 3n rectangle with right trominoes.A084477
Number of fault-free tilings of a 4 X 3n rectangle with right trominoes.
- Number of tilings of a 5 X 3n rectangle with right trominoes.A084478
Number of tilings of a 5 X 3n rectangle with right trominoes.
- Number of fault-free tilings of a 5 X 3n rectangle with right trominoes.A084479
Number of fault-free tilings of a 5 X 3n rectangle with right trominoes.
- Number of tilings of a 4 X 2n rectangle with L tetrominoes.A084480
Number of tilings of a 4 X 2n rectangle with L tetrominoes.
- Number of fault-free tilings of a 4 X 2n rectangle with L tetrominoes.A084481
Number of fault-free tilings of a 4 X 2n rectangle with L tetrominoes.
- Primes base 10 that remain primes in all nine bases b, 2<=b<=10, when the expansions are interpreted as decimal numbers.A084482
Primes base 10 that remain primes in all nine bases b, 2<=b<=10, when the expansions are interpreted as decimal numbers.
- If the rightmost block of zeros in binary representation of n has an even length, then delete one 0, otherwise insert one 0 in this block.A084483
If the rightmost block of zeros in binary representation of n has an even length, then delete one 0, otherwise insert one 0 in this block.
- a(n) = A007088(A084483(n)).A084484
a(n) = A007088(A084483(n)).
- Number of 3 X n 0-1 matrices which have n+2 1's and have no zero rows or zero columns.A084485
Number of 3 X n 0-1 matrices which have n+2 1's and have no zero rows or zero columns.
- Number of 4 X n 0-1 matrices which have n+3 1's and have no zero rows or zero columns.A084486
Number of 4 X n 0-1 matrices which have n+3 1's and have no zero rows or zero columns.
- Prime(n)+q, where q is the next prime such that q mod 4 = prime(n) mod 4.A084487
Prime(n)+q, where q is the next prime such that q mod 4 = prime(n) mod 4.
- Prime(n)+q, where q is the next prime such that q mod 4 = (prime(n)+2) mod 4.A084488
Prime(n)+q, where q is the next prime such that q mod 4 = (prime(n)+2) mod 4.
- a(n) = n + A084501(n) - 3.A084489
a(n) = n + A084501(n) - 3.
- Inverse permutation to A084489.A084490
Inverse permutation to A084489.
- Permutation of Z, obtained by reflecting the juggling sequence A084501 from positive to negative numbers (with zero thrown at beat 0), folded to N with functions N2Z and Z2N.A084491
Permutation of Z, obtained by reflecting the juggling sequence A084501 from positive to negative numbers (with zero thrown at beat 0), folded to N with functions N2Z and Z2N.
- Inverse permutation to A084491.A084492
Inverse permutation to A084491.
- a(n) = n + A084511(n) - 3.A084493
a(n) = n + A084511(n) - 3.
- Inverse permutation to A084493.A084494
Inverse permutation to A084493.
- Permutation of Z, obtained by reflecting the juggling sequence A084511 from positive to negative numbers (with zero thrown at beat 0), folded to N with functions N2Z and Z2N.A084495
Permutation of Z, obtained by reflecting the juggling sequence A084511 from positive to negative numbers (with zero thrown at beat 0), folded to N with functions N2Z and Z2N.
- Inverse permutation to A084495.A084496
Inverse permutation to A084495.
- a(n) = n + A084521(n) - 3.A084497
a(n) = n + A084521(n) - 3.
- Inverse permutation to A084497.A084498
Inverse permutation to A084497.
- Permutation of Z, obtained by reflecting the juggling sequence A084521 from positive to negative numbers (with zero thrown at beat 0), folded to N with functions N2Z and Z2N.A084499
Permutation of Z, obtained by reflecting the juggling sequence A084521 from positive to negative numbers (with zero thrown at beat 0), folded to N with functions N2Z and Z2N.
- a(0)=0, after which each n occurs A084506(n) times.A084500
a(0)=0, after which each n occurs A084506(n) times.
- An infinite juggling sequence of three balls: successively larger ground-state 3-ball site swaps listed in lexicographic order.A084501
An infinite juggling sequence of three balls: successively larger ground-state 3-ball site swaps listed in lexicographic order.
- Successively larger 3-ball ground-state site swaps of A084501 in concatenated decimal notation.A084502
Successively larger 3-ball ground-state site swaps of A084501 in concatenated decimal notation.
- Binary juggling state vectors (given in decimal), associated with the three balls juggling sequence A084501.A084503
Binary juggling state vectors (given in decimal), associated with the three balls juggling sequence A084501.
- Sequence A084503 in binary.A084504
Sequence A084503 in binary.
- Partial sums of A084506.A084505
Partial sums of A084506.
- The length of each successively larger 3-ball ground-state site swap given in A084501, i.e., the number of digits in each term of A084502.A084506
The length of each successively larger 3-ball ground-state site swap given in A084501, i.e., the number of digits in each term of A084502.
- First occurrence of n in A084501.A084507
First occurrence of n in A084501.
- Partial sums of A084509. Positions of ones in the first differences of A084506.A084508
Partial sums of A084509. Positions of ones in the first differences of A084506.
- Number of ground-state 3-ball juggling sequences of period n.A084509
Number of ground-state 3-ball juggling sequences of period n.
- a(0)=0, after which each n occurs A084516(n) times.A084510
a(0)=0, after which each n occurs A084516(n) times.