Sequences
392,541 sequences
- Number of positions that are exactly n moves from the starting position in the Orbix Type 1 puzzle.A080561
Number of positions that are exactly n moves from the starting position in the Orbix Type 1 puzzle.
- Number of positions that are exactly n moves from the starting position in the Orbix Type 2 puzzle.A080562
Number of positions that are exactly n moves from the starting position in the Orbix Type 2 puzzle.
- Number of positions that are exactly n moves from the starting position in the Orbix Type 3 puzzle.A080563
Number of positions that are exactly n moves from the starting position in the Orbix Type 3 puzzle.
- Number of positions that are exactly n moves from the starting position in the Orbix Type 4 puzzle.A080564
Number of positions that are exactly n moves from the starting position in the Orbix Type 4 puzzle.
- Binary expansion of n has form 11**...*1.A080565
Binary expansion of n has form 11**...*1.
- Partial sums of A079000.A080566
Partial sums of A079000.
- 1 + Sum_{k=2..n} 2^((prime(k)-1)/2).A080567
1 + Sum_{k=2..n} 2^((prime(k)-1)/2).
- Sum of the Fibonacci numbers A000045 and the factorials A000142.A080568
Sum of the Fibonacci numbers A000045 and the factorials A000142.
- a(n) is the first number in the first run of at least n successive numbers, all having exactly 3 distinct prime factors.A080569
a(n) is the first number in the first run of at least n successive numbers, all having exactly 3 distinct prime factors.
- Number of 1's in partition of n-th Ulam number into sum of two distinct Ulam numbers.A080570
Number of 1's in partition of n-th Ulam number into sum of two distinct Ulam numbers.
- Number of 2's in partition of n-th Ulam number into sum of two distinct Ulam numbers.A080571
Number of 2's in partition of n-th Ulam number into sum of two distinct Ulam numbers.
- Number of ordered pairs (i,j), 0 <= i,j < n, for which (i & j) is nonzero, where & is the bitwise AND operator.A080572
Number of ordered pairs (i,j), 0 <= i,j < n, for which (i & j) is nonzero, where & is the bitwise AND operator.
- Number of ways writing n as a sum of two distinct Ulam numbers.A080573
Number of ways writing n as a sum of two distinct Ulam numbers.
- a(1)=1, a(n)=a(n-1)+1 if n is odd and already in the sequence, a(n)=a(n-1)+2 if n is even and already in the sequence, a(n)=a(n-1)+3 otherwise.A080574
a(1)=1, a(n)=a(n-1)+1 if n is odd and already in the sequence, a(n)=a(n-1)+2 if n is even and already in the sequence, a(n)=a(n-1)+3 otherwise.
- Triangle of multinomial coefficients, read by rows (version 2).A080575
Triangle of multinomial coefficients, read by rows (version 2).
- Triangle in which n-th row lists all partitions of n, in graded reflected lexicographic order.A080576
Triangle in which n-th row lists all partitions of n, in graded reflected lexicographic order.
- Triangle in which n-th row lists all partitions of n, in graded reverse lexicographic ordering.A080577
Triangle in which n-th row lists all partitions of n, in graded reverse lexicographic ordering.
- a(1)=1; for n > 1, a(n) = a(n-1) + 1 if n is already in the sequence, a(n) = a(n-1) + 3 otherwise.A080578
a(1)=1; for n > 1, a(n) = a(n-1) + 1 if n is already in the sequence, a(n) = a(n-1) + 3 otherwise.
- a(1)=1; for n>1, a(n)=a(n-1)+1 if n is already in the sequence, a(n)=a(n-1)+4 otherwise.A080579
a(1)=1; for n>1, a(n)=a(n-1)+1 if n is already in the sequence, a(n)=a(n-1)+4 otherwise.
- a(1)=1; for n>1, a(n)=a(n-1)+2 if n is already in the sequence, a(n)=a(n-1)+4 otherwise.A080580
a(1)=1; for n>1, a(n)=a(n-1)+2 if n is already in the sequence, a(n)=a(n-1)+4 otherwise.
- Ratios of successive terms of A079269.A080581
Ratios of successive terms of A079269.
- Ratios of successive terms of A079278.A080582
Ratios of successive terms of A079278.
- Number of positions that the 3 X 3 X 3 Rubik cube puzzle can be in after exactly n moves.A080583
Number of positions that the 3 X 3 X 3 Rubik cube puzzle can be in after exactly n moves.
- A run of 3*2^n 0's followed by a run of 3*2^n 1's, for n=0, 1, 2, ...A080584
A run of 3*2^n 0's followed by a run of 3*2^n 1's, for n=0, 1, 2, ...
- Partial sums of A080584.A080585
Partial sums of A080584.
- A run of 3*2^n 1's followed by a run of 3*2^n 2's, for n=0, 1, 2, ...A080586
A run of 3*2^n 1's followed by a run of 3*2^n 2's, for n=0, 1, 2, ...
- Partial sums of A080586.A080587
Partial sums of A080586.
- a(n) is the smallest nonnegative integer which is consistent with sequence being monotonically increasing and satisfying a(a(n)) = 4n.A080588
a(n) is the smallest nonnegative integer which is consistent with sequence being monotonically increasing and satisfying a(a(n)) = 4n.
- a(n) is smallest nonnegative integer which is consistent with sequence being monotonically increasing and satisfying a(a(n)) = 5n.A080589
a(n) is smallest nonnegative integer which is consistent with sequence being monotonically increasing and satisfying a(a(n)) = 5n.
- a(1)=1; for n>1, a(n)=a(n-1)+3 if n is already in the sequence, a(n)=a(n-1)+4 otherwise.A080590
a(1)=1; for n>1, a(n)=a(n-1)+3 if n is already in the sequence, a(n)=a(n-1)+4 otherwise.
- a(n) is taken to be the smallest positive 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 congruent to 3 mod 4".A080591
a(n) is taken to be the smallest positive 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 congruent to 3 mod 4".
- My school teacher gave it to me as a challenge. But he died last week and I do not have the answer.A080592
My school teacher gave it to me as a challenge. But he died last week and I do not have the answer.
- Consider the standard game of Nim with 3 heaps and make a list of the losing positions (x,y,z) with x <= y <= z in reverse lexicographic order; sequence gives x values.A080593
Consider the standard game of Nim with 3 heaps and make a list of the losing positions (x,y,z) with x <= y <= z in reverse lexicographic order; sequence gives x values.
- Consider the standard game of Nim with 3 heaps and make a list of the losing positions (x,y,z) with x <= y <= z in reverse lexicographic order; sequence gives y values.A080594
Consider the standard game of Nim with 3 heaps and make a list of the losing positions (x,y,z) with x <= y <= z in reverse lexicographic order; sequence gives y values.
- Consider the standard game of Nim with 3 heaps and make a list of the losing positions (x,y,z) with x <= y <= z in reverse lexicographic order; sequence gives z values.A080595
Consider the standard game of Nim with 3 heaps and make a list of the losing positions (x,y,z) with x <= y <= z in reverse lexicographic order; sequence gives z values.
- a(1)=1; for n >= 2, a(n) is smallest positive integer which is consistent with sequence being monotonically increasing and satisfying a(a(n)) = 2n+3.A080596
a(1)=1; for n >= 2, a(n) is smallest positive integer which is consistent with sequence being monotonically increasing and satisfying a(a(n)) = 2n+3.
- Number of terms from the decimal expansion of Pi (A000796) which include every combination of n digits as consecutive subsequences.A080597
Number of terms from the decimal expansion of Pi (A000796) which include every combination of n digits as consecutive subsequences.
- For numbers k such that A080570(k) and 2*A080571(k) are distinct Ulam numbers, sequence gives A002858(k).A080598
For numbers k such that A080570(k) and 2*A080571(k) are distinct Ulam numbers, sequence gives A002858(k).
- Expansion of e.g.f.: 2/(2-2*x-x^2).A080599
Expansion of e.g.f.: 2/(2-2*x-x^2).
- a(n) = ceiling(n*(3 + sqrt(13))/2).A080600
a(n) = ceiling(n*(3 + sqrt(13))/2).
- Number of positions of the Rubik's cube at a distance of n moves from the solved state, in the half-turn metric.A080601
Number of positions of the Rubik's cube at a distance of n moves from the solved state, in the half-turn metric.
- Number of positions of the Rubik's cube at a distance of n moves from the solved state, in the quarter-turn metric.A080602
Number of positions of the Rubik's cube at a distance of n moves from the solved state, in the quarter-turn metric.
- Primes such that deleting some digit yields a prime.A080603
Primes such that deleting some digit yields a prime.
- Triangular array of hypotenuses of right triangles with integer legs: T(n,k) = round(sqrt(n^2 + k^2)), 1 <= k <= n.A080604
Triangular array of hypotenuses of right triangles with integer legs: T(n,k) = round(sqrt(n^2 + k^2)), 1 <= k <= n.
- Golomb's sequence using odd integers.A080605
Golomb's sequence using odd integers.
- Golomb's sequence using even integers.A080606
Golomb's sequence using even integers.
- Golomb's sequence using multiples of 3.A080607
Golomb's sequence using multiples of 3.
- Deletable primes: primes such that removing some digit leaves either the empty string or another deletable prime (possibly preceded by some zeros).A080608
Deletable primes: primes such that removing some digit leaves either the empty string or another deletable prime (possibly preceded by some zeros).
- Binomial transform of central Delannoy numbers A001850.A080609
Binomial transform of central Delannoy numbers A001850.
- Partial sums of Jacobsthal gap sequence.A080610
Partial sums of Jacobsthal gap sequence.