Sequences
392,541 sequences
- a(n) is the smallest number m >= 2 for which the set of prime factors of m, m-1 and m+1 contains at least the first n primes.A080611
a(n) is the smallest number m >= 2 for which the set of prime factors of m, m-1 and m+1 contains at least the first n primes.
- Numbers m such that (1/p(2*m+1)) * Sum_{k=1..m} p(2*k+1)-p(2*k) >= (1/p(2*m))* Sum_{k=1..m} p(2*k)-p(2*k-1) where p(k) denotes the k-th prime.A080612
Numbers m such that (1/p(2*m+1)) * Sum_{k=1..m} p(2*k+1)-p(2*k) >= (1/p(2*m))* Sum_{k=1..m} p(2*k)-p(2*k-1) where p(k) denotes the k-th prime.
- Minimal sequence such that Omega(a(m))<=Omega(a(n)) for m<n, where Omega=A001222 (sum of exponents in prime factorization).A080613
Minimal sequence such that Omega(a(m))<=Omega(a(n)) for m<n, where Omega=A001222 (sum of exponents in prime factorization).
- Consider a 3 X 3 X 3 Rubik's Cube, but allow only the moves T2, D2, F2; sequence gives number of positions that are exactly n moves from the start.A080614
Consider a 3 X 3 X 3 Rubik's Cube, but allow only the moves T2, D2, F2; sequence gives number of positions that are exactly n moves from the start.
- Consider 3 X 3 X 3 Rubik cube, but only allow the moves T2, D2, F2, B2; sequence gives number of positions that are exactly n moves from the start.A080615
Consider 3 X 3 X 3 Rubik cube, but only allow the moves T2, D2, F2, B2; sequence gives number of positions that are exactly n moves from the start.
- Consider 3 X 3 X 3 Rubik cube, but only allow the moves T2, F2, R2; sequence gives number of positions that are exactly n moves from the start.A080616
Consider 3 X 3 X 3 Rubik cube, but only allow the moves T2, F2, R2; sequence gives number of positions that are exactly n moves from the start.
- Consider a 3 X 3 X 3 Rubik cube, but only allow the moves M_R, D; sequence gives number of positions that are exactly n moves from the start.A080617
Consider a 3 X 3 X 3 Rubik cube, but only allow the moves M_R, D; sequence gives number of positions that are exactly n moves from the start.
- Consider 3 X 3 X 3 Rubik cube, allowing moves F, U, L, R, D and their inverses; sequence gives number of positions that are exactly n moves from the start.A080618
Consider 3 X 3 X 3 Rubik cube, allowing moves F, U, L, R, D and their inverses; sequence gives number of positions that are exactly n moves from the start.
- Consider 3 X 3 X 3 Rubik cube, but only allow the slice group to act; sequence gives number of positions that are exactly n moves from the start.A080619
Consider 3 X 3 X 3 Rubik cube, but only allow the slice group to act; sequence gives number of positions that are exactly n moves from the start.
- Consider 3 X 3 X 3 Rubik cube, but only allow the anti-slice group to act; sequence gives number of positions that are exactly n moves from the start.A080620
Consider 3 X 3 X 3 Rubik cube, but only allow the anti-slice group to act; sequence gives number of positions that are exactly n moves from the start.
- Consider 3 X 3 X 3 Rubik cube, but only allow the double anti-slice group to act; sequence gives number of positions that are exactly n moves from the start.A080621
Consider 3 X 3 X 3 Rubik cube, but only allow the double anti-slice group to act; sequence gives number of positions that are exactly n moves from the start.
- Consider 3 X 3 X 3 Rubik cube, but only allow the slice group to act; sequence gives number of positions that are exactly n moves from the start, up to equivalence under the full group of order 48 of the cube.A080622
Consider 3 X 3 X 3 Rubik cube, but only allow the slice group to act; sequence gives number of positions that are exactly n moves from the start, up to equivalence under the full group of order 48 of the cube.
- Consider 3 X 3 X 3 Rubik cube, but only allow the double slice group to act; sequence gives number of positions that are exactly n moves from the start, up to equivalence under the full group of order 48 of the cube.A080623
Consider 3 X 3 X 3 Rubik cube, but only allow the double slice group to act; sequence gives number of positions that are exactly n moves from the start, up to equivalence under the full group of order 48 of the cube.
- Consider 3 X 3 X 3 Rubik cube, but only allow the double slice group to act; sequence gives number of positions that are exactly n moves from the start.A080624
Consider 3 X 3 X 3 Rubik cube, but only allow the double slice group to act; sequence gives number of positions that are exactly n moves from the start.
- Consider 3 X 3 X 3 Rubik cube, but only allow the anti-slice group to act; sequence gives number of positions that are exactly n moves from the start, up to equivalence under the full group of order 48 of the cube.A080625
Consider 3 X 3 X 3 Rubik cube, but only allow the anti-slice group to act; sequence gives number of positions that are exactly n moves from the start, up to equivalence under the full group of order 48 of the cube.
- Consider 3 X 3 X 3 Rubik cube, but only allow the double anti-slice group to act; sequence gives number of positions that are exactly n moves from the start, up to equivalence under the full group of order 48 of the cube.A080626
Consider 3 X 3 X 3 Rubik cube, but only allow the double anti-slice group to act; sequence gives number of positions that are exactly n moves from the start, up to equivalence under the full group of order 48 of the cube.
- Consider 3 X 3 X 3 Rubik cube, but only allow the squares group to act; sequence gives number of positions that are exactly n moves from the start.A080627
Consider 3 X 3 X 3 Rubik cube, but only allow the squares group to act; sequence gives number of positions that are exactly n moves from the start.
- Consider 3 X 3 X 3 Rubik cube, but only allow the <U, R> group to act; sequence gives number of positions that are exactly n moves from the start.A080628
Consider 3 X 3 X 3 Rubik cube, but only allow the <U, R> group to act; sequence gives number of positions that are exactly n moves from the start.
- Consider 3 X 3 X 3 Rubik cube, but consider only positions of corners; sequence gives number of positions that are exactly n moves from the start.A080629
Consider 3 X 3 X 3 Rubik cube, but consider only positions of corners; sequence gives number of positions that are exactly n moves from the start.
- Consider 3 X 3 X 3 Rubik cube, but consider only positions of corners; sequence gives number of positions that are exactly n moves from the start.A080630
Consider 3 X 3 X 3 Rubik cube, but consider only positions of corners; sequence gives number of positions that are exactly n moves from the start.
- Consider 3 X 3 X 3 Rubik cube, but consider only positions of edges; sequence gives number of positions that are exactly n moves from the start up to equivalence under the full group of order 48 of the cube.A080631
Consider 3 X 3 X 3 Rubik cube, but consider only positions of edges; sequence gives number of positions that are exactly n moves from the start up to equivalence under the full group of order 48 of the cube.
- Consider 3 X 3 X 3 Rubik cube, but consider only positions of edges; sequence gives number of positions that are exactly n moves from the start up to equivalence under the full group of order 48 of the cube.A080632
Consider 3 X 3 X 3 Rubik cube, but consider only positions of edges; sequence gives number of positions that are exactly n moves from the start up to equivalence under the full group of order 48 of the cube.
- a(1)=3; for n > 1, a(n) is the smallest integer greater than a(n-1) consistent with the condition "n is in the sequence if and only if a(n) is congruent to 1 (mod 4)".A080633
a(1)=3; for n > 1, a(n) is the smallest integer greater than a(n-1) consistent with the condition "n is in the sequence if and only if a(n) is congruent to 1 (mod 4)".
- Start with a(1)=1. Then, for n>1, choose a(n)=1 or 2 so as to minimize the longest arithmetic progression in either S1(n) or S2(n), where S1(n)={k|a(k)=1,1<=k<=n} and S2(n)={k|a(k)=2,1<=k<=n}.A080634
Start with a(1)=1. Then, for n>1, choose a(n)=1 or 2 so as to minimize the longest arithmetic progression in either S1(n) or S2(n), where S1(n)={k|a(k)=1,1<=k<=n} and S2(n)={k|a(k)=2,1<=k<=n}.
- Number of permutations on n letters without double falls and without initial falls.A080635
Number of permutations on n letters without double falls and without initial falls.
- Number of symmetric real invertible (0,1) n X n matrices with (-1,0,1) inverses.A080636
Number of symmetric real invertible (0,1) n X n matrices with (-1,0,1) inverses.
- a(n) is the smallest positive integer which is consistent with the sequence being monotonically increasing and satisfying a(1)=2, a(a(n)) = 2n+1 for n > 1.A080637
a(n) is the smallest positive integer which is consistent with the sequence being monotonically increasing and satisfying a(1)=2, a(a(n)) = 2n+1 for n > 1.
- Number of positions that the 3 X 3 X 3 Rubik cube puzzle can be in after exactly n moves, up to equivalence under the full group of order 48 of the cube and with a half-turn is considered to be 1 move.A080638
Number of positions that the 3 X 3 X 3 Rubik cube puzzle can be in after exactly n moves, up to equivalence under the full group of order 48 of the cube and with a half-turn is considered to be 1 move.
- a(1) = 1; for n>1, a(n) is taken to be the smallest integer greater than a(n-1) which is consistent with the condition "for n>1, n is a member of the sequence if and only if a(n) is even".A080639
a(1) = 1; for n>1, a(n) is taken to be the smallest integer greater than a(n-1) which is consistent with the condition "for n>1, n is a member of the sequence if and only if a(n) is even".
- a(1) = 3; for n>1, a(n) is taken to be the smallest integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) is divisible by 4".A080640
a(1) = 3; for n>1, a(n) is taken to be the smallest integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) is divisible by 4".
- a(1) = 4; for n>1, a(n) is taken to be the smallest integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) is divisible by 5".A080641
a(1) = 4; for n>1, a(n) is taken to be the smallest integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) is divisible by 5".
- Cubefree taxicab numbers: the smallest cubefree number that is the sum of 2 positive cubes in n ways.A080642
Cubefree taxicab numbers: the smallest cubefree number that is the sum of 2 positive cubes in n ways.
- a(0)=0; for n>0, a(n) = 4^n - 2*3^(n-1).A080643
a(0)=0; for n>0, a(n) = 4^n - 2*3^(n-1).
- a(1) = 5; for n>1, a(n) is taken to be the smallest integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) is divisible by 6".A080644
a(1) = 5; for n>1, a(n) is taken to be the smallest integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) is divisible by 6".
- a(1) = 1; for n>1, a(n) is taken to be the smallest integer greater than a(n-1) which is consistent with the condition "for n>1, if n is a member of the sequence then a(n) is even".A080645
a(1) = 1; for n>1, a(n) is taken to be the smallest integer greater than a(n-1) which is consistent with the condition "for n>1, if n is a member of the sequence then a(n) is even".
- a(1) = 3; for n>1, a(n) is taken to be the smallest integer greater than a(n-1) which is consistent with the condition "if n is a member of the sequence then a(n) is divisible by 4".A080646
a(1) = 3; for n>1, a(n) is taken to be the smallest integer greater than a(n-1) which is consistent with the condition "if n is a member of the sequence then a(n) is divisible by 4".
- Sum of prime factors of phi(n).A080647
Sum of prime factors of phi(n).
- Sum of prime factors of Fibonacci(n).A080648
Sum of prime factors of Fibonacci(n).
- Sum of prime factors of sigma(n).A080649
Sum of prime factors of sigma(n).
- Numbers n such that phi(n) and sigma(n) have the same number of divisors.A080650
Numbers n such that phi(n) and sigma(n) have the same number of divisors.
- Numbers n such that n and Fibonacci(n) have the same number of divisors.A080651
Numbers n such that n and Fibonacci(n) have the same number of divisors.
- a(1)=2; for n>1, a(n)=a(n-1)+3 if n is already in the sequence, a(n)=a(n-1)+2 otherwise.A080652
a(1)=2; for n>1, a(n)=a(n-1)+3 if n is already in the sequence, a(n)=a(n-1)+2 otherwise.
- a(1) = 2; for n>1, a(n) is taken to be the smallest integer greater than a(n-1) such that the condition "a(a(n)) is always even" is satisfied.A080653
a(1) = 2; for n>1, a(n) is taken to be the smallest integer greater than a(n-1) such that the condition "a(a(n)) is always even" is satisfied.
- Smallest number with exactly n representations as a sum of five positive squares or 0 if no such number exists (cf. A025429).A080654
Smallest number with exactly n representations as a sum of five positive squares or 0 if no such number exists (cf. A025429).
- a(1) = a(2) = 1; for n >= 2, a(n+1) = a(n) + a(j(n)) where j(m) = largest divisor of m that is < m.A080655
a(1) = a(2) = 1; for n >= 2, a(n+1) = a(n) + a(j(n)) where j(m) = largest divisor of m that is < m.
- Order of group of n X n X n Rubik cube, under assumptions not-s, m, not-i.A080656
Order of group of n X n X n Rubik cube, under assumptions not-s, m, not-i.
- Duplicate of A075152.A080657
Duplicate of A075152.
- Order of group of n X n X n Rubik cube, under assumptions not-s, not-m, i.A080658
Order of group of n X n X n Rubik cube, under assumptions not-s, not-m, i.
- Order of group of n X n X n Rubik cube, under assumptions s, m, i.A080659
Order of group of n X n X n Rubik cube, under assumptions s, m, i.
- Order of group of n X n X n Rubik cube, under assumptions s, m, not-i.A080660
Order of group of n X n X n Rubik cube, under assumptions s, m, not-i.