Sequences
392,541 sequences
- Number of ways to color vertices of a 9-gon using <= n colors, allowing rotations and reflections.A060561
Number of ways to color vertices of a 9-gon using <= n colors, allowing rotations and reflections.
- Number of ways to color vertices of a 10-gon using <= n colors, allowing rotations and reflections.A060562
Number of ways to color vertices of a 10-gon using <= n colors, allowing rotations and reflections.
- First n digits after decimal point in the expansion of sqrt(n), or 0 if n is a square. Leading zeros omitted.A060563
First n digits after decimal point in the expansion of sqrt(n), or 0 if n is a square. Leading zeros omitted.
- Number of elliptic curves (up to isogeny) of conductor n.A060564
Number of elliptic curves (up to isogeny) of conductor n.
- Follow trajectory of 2n+1 in the '3x+1' problem until a lower number is reached; A060445 gives number of steps for this to happen. Sequence gives the first lower number that is reached.A060565
Follow trajectory of 2n+1 in the '3x+1' problem until a lower number is reached; A060445 gives number of steps for this to happen. Sequence gives the first lower number that is reached.
- a(n) = n^2 - 79*n + 1601.A060566
a(n) = n^2 - 79*n + 1601.
- Number of binomial coefficients C(n,j) with j=0..n that are divisible by C(n,2).A060567
Number of binomial coefficients C(n,j) with j=0..n that are divisible by C(n,2).
- Number of primes between n and R(n) where R(n) (A004086) is the digit reversal of n.A060568
Number of primes between n and R(n) where R(n) (A004086) is the digit reversal of n.
- Consider Pythagorean triples which satisfy X^2+(X+7)^2=Z^2; sequence gives increasing values of Z.A060569
Consider Pythagorean triples which satisfy X^2+(X+7)^2=Z^2; sequence gives increasing values of Z.
- Number of flips between the d-dimensional tilings of the unary zonotope Z(D,d). Here d=2 and D varies.A060570
Number of flips between the d-dimensional tilings of the unary zonotope Z(D,d). Here d=2 and D varies.
- Tower of Hanoi: the optimal way to move an even number of disks from peg 0 to peg 2 or an odd number from peg 0 to peg 1 is on move n to move disk A001511 from peg A060571 (here) to peg A060572.A060571
Tower of Hanoi: the optimal way to move an even number of disks from peg 0 to peg 2 or an odd number from peg 0 to peg 1 is on move n to move disk A001511 from peg A060571 (here) to peg A060572.
- Tower of Hanoi: the optimal way to move an even number of disks from peg 0 to peg 2 or an odd number from peg 0 to peg 1 is on move n to move disk A001511 from peg A060571 to peg A060572 (here).A060572
Tower of Hanoi: the optimal way to move an even number of disks from peg 0 to peg 2 or an odd number from peg 0 to peg 1 is on move n to move disk A001511 from peg A060571 to peg A060572 (here).
- Tower of Hanoi: using the optimal way to move an even number of disks from peg 0 to peg 2 or an odd number from peg 0 to peg 1, a(n) is the smallest disk on peg 0 after n moves.A060573
Tower of Hanoi: using the optimal way to move an even number of disks from peg 0 to peg 2 or an odd number from peg 0 to peg 1, a(n) is the smallest disk on peg 0 after n moves.
- Tower of Hanoi: using the optimal way to move an even number of disks from peg 0 to peg 2 or an odd number from peg 0 to peg 1, a(n) is the smallest disk on peg 1 after n moves (or 0 if there are no disks on peg 1).A060574
Tower of Hanoi: using the optimal way to move an even number of disks from peg 0 to peg 2 or an odd number from peg 0 to peg 1, a(n) is the smallest disk on peg 1 after n moves (or 0 if there are no disks on peg 1).
- Tower of Hanoi: using the optimal way to move an even number of disks from peg 0 to peg 2 or an odd number from peg 0 to peg 1, a(n) is the smallest disk on peg 2 after n moves (or 0 if there are no disks on peg 2).A060575
Tower of Hanoi: using the optimal way to move an even number of disks from peg 0 to peg 2 or an odd number from peg 0 to peg 1, a(n) is the smallest disk on peg 2 after n moves (or 0 if there are no disks on peg 2).
- a(n) = 1 except for a(1) = 0.A060576
a(n) = 1 except for a(1) = 0.
- Number of homeomorphically irreducible general graphs on 2 labeled nodes and with n edges.A060577
Number of homeomorphically irreducible general graphs on 2 labeled nodes and with n edges.
- Number of homeomorphically irreducible general graphs on 3 labeled node and with n edges.A060578
Number of homeomorphically irreducible general graphs on 3 labeled node and with n edges.
- Number of homeomorphically irreducible general graphs on 4 labeled nodes and with n edges.A060579
Number of homeomorphically irreducible general graphs on 4 labeled nodes and with n edges.
- Number of homeomorphically irreducible general graphs on 5 labeled nodes and with n edges.A060580
Number of homeomorphically irreducible general graphs on 5 labeled nodes and with n edges.
- Number of homeomorphically irreducible general graphs on 6 labeled node and with n edges.A060581
Number of homeomorphically irreducible general graphs on 6 labeled node and with n edges.
- If the final digit of n in base 3 is the same as a([n/3]) then this digit, otherwise a(n)= mod 3-sum of these two digits, with a(0)=0.A060582
If the final digit of n in base 3 is the same as a([n/3]) then this digit, otherwise a(n)= mod 3-sum of these two digits, with a(0)=0.
- A ternary code related to the Tower of Hanoi.A060583
A ternary code related to the Tower of Hanoi.
- Compare ultimate and penultimate digits of n base 3, i.e., 0 if n mod 3 = floor(n/3) mod 3, 1 otherwise; also 0 if (n mod 9) is a multiple of 4, 1 otherwise.A060584
Compare ultimate and penultimate digits of n base 3, i.e., 0 if n mod 3 = floor(n/3) mod 3, 1 otherwise; also 0 if (n mod 9) is a multiple of 4, 1 otherwise.
- Write n in base 3, then (working from left to right) if the k-th digit of n is not equal to the digit to its left then the k-th digit of a(n) is 1, otherwise it is 0, and finally read the result as a base-2 number.A060585
Write n in base 3, then (working from left to right) if the k-th digit of n is not equal to the digit to its left then the k-th digit of a(n) is 1, otherwise it is 0, and finally read the result as a base-2 number.
- Minimum number of moves required to reach position n starting from 0 in Tower of Hanoi (with three pegs: 0,1,2), where with position n written in base 3, xyz means smallest disk is on peg z, second smallest is on peg y, third smallest on peg x, etc. and leading zeros indicate largest disks are all on peg 0.A060586
Minimum number of moves required to reach position n starting from 0 in Tower of Hanoi (with three pegs: 0,1,2), where with position n written in base 3, xyz means smallest disk is on peg z, second smallest is on peg y, third smallest on peg x, etc. and leading zeros indicate largest disks are all on peg 0.
- A ternary code: inverse of A060583.A060587
A ternary code: inverse of A060583.
- If the final two digits of n written in base 3 are the same then this digit, otherwise mod 3-sum of these two digits.A060588
If the final two digits of n written in base 3 are the same then this digit, otherwise mod 3-sum of these two digits.
- a(n) = 2*(2^n-1)*3^(n-1).A060589
a(n) = 2*(2^n-1)*3^(n-1).
- Numerator of the expected time to finish a random Tower of Hanoi problem with n disks using optimal moves.A060590
Numerator of the expected time to finish a random Tower of Hanoi problem with n disks using optimal moves.
- Integers i > 1 for which there is no prime p such that i is a solution mod p of x^3 = 2.A060591
Integers i > 1 for which there is no prime p such that i is a solution mod p of x^3 = 2.
- Square table by antidiagonals of minimum number of moves between two positions in the Tower of Hanoi (with three pegs: 0,1,2), where with position n written in base 3, xyz means smallest disk is on peg z, second smallest is on peg y, third smallest on peg x, etc. and leading zeros indicate largest disks are all on peg 0.A060592
Square table by antidiagonals of minimum number of moves between two positions in the Tower of Hanoi (with three pegs: 0,1,2), where with position n written in base 3, xyz means smallest disk is on peg z, second smallest is on peg y, third smallest on peg x, etc. and leading zeros indicate largest disks are all on peg 0.
- a(n) is the number of ways that a cycle of length 2n+1 in the symmetric group S_(2n+1) can be decomposed as the product of two cycles of length 2n+1.A060593
a(n) is the number of ways that a cycle of length 2n+1 in the symmetric group S_(2n+1) can be decomposed as the product of two cycles of length 2n+1.
- Number of solutions to x^2 == 1 (mod n), that is, square roots of unity modulo n.A060594
Number of solutions to x^2 == 1 (mod n), that is, square roots of unity modulo n.
- Number of tilings of the 3-dimensional zonotope constructed from D vectors.A060595
Number of tilings of the 3-dimensional zonotope constructed from D vectors.
- Number of tilings of the 4-dimensional zonotope constructed from D vectors.A060596
Number of tilings of the 4-dimensional zonotope constructed from D vectors.
- Number of tilings of the 6-dimensional zonotope constructed from D vectors.A060597
Number of tilings of the 6-dimensional zonotope constructed from D vectors.
- Number of tilings of the 7-dimensional zonotope constructed from D vectors.A060598
Number of tilings of the 7-dimensional zonotope constructed from D vectors.
- Number of tilings of the 5-dimensional zonotope constructed from D vectors.A060599
Number of tilings of the 5-dimensional zonotope constructed from D vectors.
- Number of tilings of the 8-dimensional zonotope constructed from D vectors.A060600
Number of tilings of the 8-dimensional zonotope constructed from D vectors.
- Number of tilings of the 9-dimensional zonotope constructed from D vectors.A060601
Number of tilings of the 9-dimensional zonotope constructed from D vectors.
- Number of tilings of the d-dimensional zonotope constructed from d+3 vectors.A060602
Number of tilings of the d-dimensional zonotope constructed from d+3 vectors.
- Number of ways of expressing an n-cycle in the symmetric group S_n as a product of n+1 transpositions.A060603
Number of ways of expressing an n-cycle in the symmetric group S_n as a product of n+1 transpositions.
- a(n) = binomial(prime(n), n) where prime(n) = n-th prime.A060604
a(n) = binomial(prime(n), n) where prime(n) = n-th prime.
- a(n) = sum of lengths of the iteration sequences of Euler totient function from 1 to n.A060605
a(n) = sum of lengths of the iteration sequences of Euler totient function from 1 to n.
- The n-th term is the sum of lengths of iteration chains to get fixed points (=1) for the Euler totient function from 1 to n.A060606
The n-th term is the sum of lengths of iteration chains to get fixed points (=1) for the Euler totient function from 1 to n.
- Number of iterations of phi(x) at prime(n) needed to reach 1.A060607
Number of iterations of phi(x) at prime(n) needed to reach 1.
- Number of flips between the d-dimensional tilings of the unary zonotope Z(D,d). Here d=3 and D varies.A060608
Number of flips between the d-dimensional tilings of the unary zonotope Z(D,d). Here d=3 and D varies.
- Repeatedly apply Euler phi to n-th prime; a(n) = highest power of 2 that is seen.A060609
Repeatedly apply Euler phi to n-th prime; a(n) = highest power of 2 that is seen.
- Repeatedly apply Euler phi to the n-th prime; a(n) is the number of terms in the resulting iteration chain which are not powers of 2 (number of initial iterations until reaching the first power of 2).A060610
Repeatedly apply Euler phi to the n-th prime; a(n) is the number of terms in the resulting iteration chain which are not powers of 2 (number of initial iterations until reaching the first power of 2).