Sequences
392,541 sequences
- Number of positions that are exactly n moves from the starting position in the 2 X 2 X 2 Rubik cube puzzle counting a half-turn as a single move.A079761
Number of positions that are exactly n moves from the starting position in the 2 X 2 X 2 Rubik cube puzzle counting a half-turn as a single move.
- Number of positions that are exactly n moves from the starting position in the 2 X 2 X 2 Rubik cube puzzle.A079762
Number of positions that are exactly n moves from the starting position in the 2 X 2 X 2 Rubik cube puzzle.
- Number of positions that are exactly n moves from the starting position in the Beachball Skewb puzzle.A079763
Number of positions that are exactly n moves from the starting position in the Beachball Skewb puzzle.
- Number of positions that are exactly n moves from the starting position in the Pyramorphix puzzle.A079764
Number of positions that are exactly n moves from the starting position in the Pyramorphix puzzle.
- Duplicate of A079743.A079765
Duplicate of A079743.
- Number of positions that are exactly n moves from the starting position in the Dino Cube puzzle.A079766
Number of positions that are exactly n moves from the starting position in the Dino Cube puzzle.
- Number of positions that are exactly n moves from the starting position in the Dino Cube puzzle, mirror positions counted once.A079767
Number of positions that are exactly n moves from the starting position in the Dino Cube puzzle, mirror positions counted once.
- Number of positions that are exactly n moves from the starting position in the Rainbow Cube puzzle.A079768
Number of positions that are exactly n moves from the starting position in the Rainbow Cube puzzle.
- Number of positions that are exactly n moves from the starting position in the Bandaged Pyraminx puzzle.A079769
Number of positions that are exactly n moves from the starting position in the Bandaged Pyraminx puzzle.
- Number of configurations that are exactly n moves from the starting position in the Bicube or Bandaged Rubik's Cube puzzle.A079770
Number of configurations that are exactly n moves from the starting position in the Bicube or Bandaged Rubik's Cube puzzle.
- Number of positions that are exactly n moves from the starting position in the Bicube or Bandaged Rubik's Cube puzzle.A079771
Number of positions that are exactly n moves from the starting position in the Bicube or Bandaged Rubik's Cube puzzle.
- Let C(n) be the n-th composite number; then a(n) is the smallest number > C(n) and not coprime to C(n).A079772
Let C(n) be the n-th composite number; then a(n) is the smallest number > C(n) and not coprime to C(n).
- a(n) = 2*a(n-1)+15*a(n-2) with n>0, a(0)=0, a(1)=1.A079773
a(n) = 2*a(n-1)+15*a(n-2) with n>0, a(0)=0, a(1)=1.
- Consider the triangle shown below in which the n-th row contains the n smallest terms in increasing order having a common factor > 1, the first term being the n-th composite number; sequence gives the last term of each row.A079774
Consider the triangle shown below in which the n-th row contains the n smallest terms in increasing order having a common factor > 1, the first term being the n-th composite number; sequence gives the last term of each row.
- Triangle in A079774 read by rows.A079775
Triangle in A079774 read by rows.
- a(n) = sum of n-th row of the triangle pertaining to A079774(n).A079776
a(n) = sum of n-th row of the triangle pertaining to A079774(n).
- a(0) = 0, a(1) = 1; for n > 1, a(n) = (a(n-1) + a(n-2)) (mod n).A079777
a(0) = 0, a(1) = 1; for n > 1, a(n) = (a(n-1) + a(n-2)) (mod n).
- a(n) = smallest prime number such that a(n) - n is composite.A079778
a(n) = smallest prime number such that a(n) - n is composite.
- a(n) = smallest prime > n*prime(n).A079779
a(n) = smallest prime > n*prime(n).
- a(n) = largest prime <= n*prime(n).A079780
a(n) = largest prime <= n*prime(n).
- Initial term of n-th row of triangle in A079784.A079781
Initial term of n-th row of triangle in A079784.
- Final term of n-th row of triangle in A079784.A079782
Final term of n-th row of triangle in A079784.
- Sum of n-th row of triangle in A079784.A079783
Sum of n-th row of triangle in A079784.
- Triangle read by rows in which the n-th row contains the smallest set of n consecutive numbers such that the r-th number in the n-th row is divisible by n-r+1. The first term of the n-th row must exceed n.A079784
Triangle read by rows in which the n-th row contains the smallest set of n consecutive numbers such that the r-th number in the n-th row is divisible by n-r+1. The first term of the n-th row must exceed n.
- Number of positions that are exactly n moves from the starting position in the Beachball puzzle.A079785
Number of positions that are exactly n moves from the starting position in the Beachball puzzle.
- Triangle read by rows in which the n-th row begins with n and contains at most tau(n) numbers. The r-th term from right is the largest number < n with r divisors, for 1 <= r <= tau(n) skipping any r for which no suitable number exists.A079786
Triangle read by rows in which the n-th row begins with n and contains at most tau(n) numbers. The r-th term from right is the largest number < n with r divisors, for 1 <= r <= tau(n) skipping any r for which no suitable number exists.
- Sum of terms in n-th row of triangle in A079786.A079787
Sum of terms in n-th row of triangle in A079786.
- a(n) = count of numbers <= n for which the number of divisors is also <= tau(n).A079788
a(n) = count of numbers <= n for which the number of divisors is also <= tau(n).
- a(n) = number of nonnegative integers m <= n having at least one digit in common with n.A079789
a(n) = number of nonnegative integers m <= n having at least one digit in common with n.
- a(n) = number of m <= n which can be obtained by deleting digits from n.A079790
a(n) = number of m <= n which can be obtained by deleting digits from n.
- a(1) = 1, a(n) = a(n-1)/n if a(n-1) is divisible by n else a(n) is the concatenation of a(n-1) and n.A079791
a(1) = 1, a(n) = a(n-1)/n if a(n-1) is divisible by n else a(n) is the concatenation of a(n-1) and n.
- a(1) = 1, a(n) = a(n-1)/gcd(a(n-1),n) if gcd(a(n-1),n) > 1 otherwise a(n) is the concatenation of a(n-1) and n.A079792
a(1) = 1, a(n) = a(n-1)/gcd(a(n-1),n) if gcd(a(n-1),n) > 1 otherwise a(n) is the concatenation of a(n-1) and n.
- Smallest multiple of n having an equal number of ones and zeros and no other digits.A079793
Smallest multiple of n having an equal number of ones and zeros and no other digits.
- Smallest number having k digits "k" (k=1,...,n) but any two adjacent digits are different.A079794
Smallest number having k digits "k" (k=1,...,n) but any two adjacent digits are different.
- Duplicate of A052037.A079795
Duplicate of A052037.
- Primes p such that (3*p)^2 + p^2 + 3^2 and (3*p)^2 - p^2 - 3^2 are both prime.A079796
Primes p such that (3*p)^2 + p^2 + 3^2 and (3*p)^2 - p^2 - 3^2 are both prime.
- Products of two primes p and q such that (p*q)^2 + p^2 - q^2 and (p*q)^2 - p^2 + q^2 are both prime.A079797
Products of two primes p and q such that (p*q)^2 + p^2 - q^2 and (p*q)^2 - p^2 + q^2 are both prime.
- Partition of positive integers into shortest possible groups, starting with (1), (2,3), (4,5,6), (7,8,9,10,11), such that a(n) = the sum of the terms of the n-th group is a multiple of a(n-1) and a(n) > a(n-1).A079798
Partition of positive integers into shortest possible groups, starting with (1), (2,3), (4,5,6), (7,8,9,10,11), such that a(n) = the sum of the terms of the n-th group is a multiple of a(n-1) and a(n) > a(n-1).
- Ratios of successive terms in A079798.A079799
Ratios of successive terms in A079798.
- Initial term of n-th group in A079798.A079800
Initial term of n-th group in A079798.
- Final term of n-th group in A079798.A079801
Final term of n-th group in A079798.
- Group the prime numbers so that the sum of the terms of the n-th group is a multiple of that of the (n-1)-st group: (2), (3,5), (7,11,13,17), (19,23,29,31,37...,79,83), ...; a(n) = sum of n-th group.A079802
Group the prime numbers so that the sum of the terms of the n-th group is a multiple of that of the (n-1)-st group: (2), (3,5), (7,11,13,17), (19,23,29,31,37...,79,83), ...; a(n) = sum of n-th group.
- A079802(n)/A079802(n-1).A079803
A079802(n)/A079802(n-1).
- Initial term of n-th group in A079802.A079804
Initial term of n-th group in A079802.
- Final term of n-th group in A079802.A079805
Final term of n-th group in A079802.
- Number of even numbers that can be formed by permuting the digits of n.A079806
Number of even numbers that can be formed by permuting the digits of n.
- Number of multiples of 3 that can be formed by permuting the digits of n.A079807
Number of multiples of 3 that can be formed by permuting the digits of n.
- Consider a triangle in which the 2n-th row contains first 2n positive integers in decreasing order and the (2n+1)-st row contains first 2n+1 positive integers in increasing order; sequence contains concatenation of numbers read upward at a 45-degree angle.A079808
Consider a triangle in which the 2n-th row contains first 2n positive integers in decreasing order and the (2n+1)-st row contains first 2n+1 positive integers in increasing order; sequence contains concatenation of numbers read upward at a 45-degree angle.
- Consider a triangle in which the 2n-th row contains first 2n positive integers in increasing order and the (2n+1)-st row contains first 2n+1 positive integers in decreasing order; sequence contains concatenation of numbers read upward at a 45-degree angle.A079809
Consider a triangle in which the 2n-th row contains first 2n positive integers in increasing order and the (2n+1)-st row contains first 2n+1 positive integers in decreasing order; sequence contains concatenation of numbers read upward at a 45-degree angle.
- Sums of diagonals (upward from left to right) of the triangle shown in A079809.A079810
Sums of diagonals (upward from left to right) of the triangle shown in A079809.