Sequences
392,541 sequences
- Sum of numbers read upward at a 45-degree angle in A079809.A079811
Sum of numbers read upward at a 45-degree angle in A079809.
- Lower of twin primes (p,p+2) such that (p*(p+2))^2 + p^2 - (p+2)^2 and (p*(p+2))^2 - p^2 + (p+2)^2 are both prime.A079812
Lower of twin primes (p,p+2) such that (p*(p+2))^2 + p^2 - (p+2)^2 and (p*(p+2))^2 - p^2 + (p+2)^2 are both prime.
- n 0's followed by n 1's.A079813
n 0's followed by n 1's.
- Odd integers k such that phi(k)/k < 6/Pi^2 where phi = A000010.A079814
Odd integers k such that phi(k)/k < 6/Pi^2 where phi = A000010.
- Number of equivalent classes of n X n 0-1 matrices with 3 1's in each row and column.A079815
Number of equivalent classes of n X n 0-1 matrices with 3 1's in each row and column.
- Number of permutations satisfying -k <= p(i)-i <= r and p(i)-i not in I, i=1..n, with k=1, r=5, I={1}.A079816
Number of permutations satisfying -k <= p(i)-i <= r and p(i)-i not in I, i=1..n, with k=1, r=5, I={1}.
- Number of positions that are exactly n moves from the starting position in the Roundy puzzle.A079817
Number of positions that are exactly n moves from the starting position in the Roundy puzzle.
- Number of positions that are exactly n moves from the starting position in the Saturn puzzle.A079818
Number of positions that are exactly n moves from the starting position in the Saturn puzzle.
- Number of positions that are exactly n moves from the starting position in the Rubik's UFO puzzle.A079819
Number of positions that are exactly n moves from the starting position in the Rubik's UFO puzzle.
- Number of positions that are exactly n moves from the starting position in the Rubik's UFO puzzle.A079820
Number of positions that are exactly n moves from the starting position in the Rubik's UFO puzzle.
- Smallest n-digit multiple of the n-th prime.A079821
Smallest n-digit multiple of the n-th prime.
- Smallest n-digit multiple of the n-th composite number.A079822
Smallest n-digit multiple of the n-th composite number.
- Consider the triangle shown below; sequence contains the concatenation of numbers read at a 45-degree angle upwards with horizontal beginning with the first term of a row.A079823
Consider the triangle shown below; sequence contains the concatenation of numbers read at a 45-degree angle upwards with horizontal beginning with the first term of a row.
- Sum of numbers in n-th upward diagonal of triangle in A079823.A079824
Sum of numbers in n-th upward diagonal of triangle in A079823.
- Sum of numbers in n-th upward diagonal of triangle in A079826.A079825
Sum of numbers in n-th upward diagonal of triangle in A079826.
- Consider the triangle shown below; sequence contains the concatenation of numbers read at a 45-degree angle upwards with horizontal beginning with the first term of a row.A079826
Consider the triangle shown below; sequence contains the concatenation of numbers read at a 45-degree angle upwards with horizontal beginning with the first term of a row.
- a(n) = floor((n + reverse(n))/2).A079827
a(n) = floor((n + reverse(n))/2).
- Duplicate of A061229.A079828
Duplicate of A061229.
- a(n) = smallest k such that floor(reverse(k)/k) >= n.A079829
a(n) = smallest k such that floor(reverse(k)/k) >= n.
- Number of positions that are exactly n moves from the starting position in the Rubik's Cheese puzzle.A079830
Number of positions that are exactly n moves from the starting position in the Rubik's Cheese puzzle.
- Numbers k such that floor(reverse(k)/k) = 2.A079831
Numbers k such that floor(reverse(k)/k) = 2.
- Numbers k such that floor(reverse(k)/k) = 3.A079832
Numbers k such that floor(reverse(k)/k) = 3.
- Define f(n) = n + tau(n), then a(n) = smallest prime of the type f(f(f...f(n)))).A079833
Define f(n) = n + tau(n), then a(n) = smallest prime of the type f(f(f...f(n)))).
- Define f(n)= n + tau(n), then a(n) = k where k is the number of steps required to get the smallest prime of the form f(f(f...f(n)))).A079834
Define f(n)= n + tau(n), then a(n) = k where k is the number of steps required to get the smallest prime of the form f(f(f...f(n)))).
- Smallest number such that there are exactly n numbers between a(n) and a(n+1) with n divisors.A079835
Smallest number such that there are exactly n numbers between a(n) and a(n+1) with n divisors.
- First column of the triangle in which the n-th row contains n numbers with n divisors that lie between A079835(n) and A079835(n+1).A079836
First column of the triangle in which the n-th row contains n numbers with n divisors that lie between A079835(n) and A079835(n+1).
- Leading diagonal of triangle in A079836.A079837
Leading diagonal of triangle in A079836.
- a(1)=1 and for n>1, a(n) is the smallest multiple of a(n-1) which has no nonzero digit in common with a(n-1).A079838
a(1)=1 and for n>1, a(n) is the smallest multiple of a(n-1) which has no nonzero digit in common with a(n-1).
- Number of positions that are exactly n moves from the starting position in the Billiards Nine-Ball puzzle.A079839
Number of positions that are exactly n moves from the starting position in the Billiards Nine-Ball puzzle.
- Largest multiple of n as a concatenation of its partitions.A079840
Largest multiple of n as a concatenation of its partitions.
- Duplicate of A069869.A079841
Duplicate of A069869.
- Largest square which is a concatenation of partitions of n; or 0 if no such number exists.A079842
Largest square which is a concatenation of partitions of n; or 0 if no such number exists.
- Number of positions that are exactly n moves from the starting position in the Rashkey Type 1 puzzle.A079843
Number of positions that are exactly n moves from the starting position in the Rashkey Type 1 puzzle.
- Number of positions that are exactly n moves from the starting position in the Rashkey Type 1 puzzle.A079844
Number of positions that are exactly n moves from the starting position in the Rashkey Type 1 puzzle.
- Powers of 2 which differ at all digits from the previous term.A079845
Powers of 2 which differ at all digits from the previous term.
- Powers of 3 which differ at all digits from the previous term.A079846
Powers of 3 which differ at all digits from the previous term.
- Smallest multiple of n in which the string of digits of n occurs after (n-1) most significant digits.A079847
Smallest multiple of n in which the string of digits of n occurs after (n-1) most significant digits.
- Smallest primes such that a(j) - a(k) are all different.A079848
Smallest primes such that a(j) - a(k) are all different.
- First differences of A079848.A079849
First differences of A079848.
- a(1) = 1 and then the smallest primes such that all a(k)-a(j) are distinct composite numbers.A079850
a(1) = 1 and then the smallest primes such that all a(k)-a(j) are distinct composite numbers.
- Duplicate of A066720.A079851
Duplicate of A066720.
- a(1) = 1, a(2) = 2, a(3) = 3 and a(n) is the smallest number such that all a(i)*a(j)*a(k) are different.A079852
a(1) = 1, a(2) = 2, a(3) = 3 and a(n) is the smallest number such that all a(i)*a(j)*a(k) are different.
- Primes p for which (p-2)! == 1 (mod p^2).A079853
Primes p for which (p-2)! == 1 (mod p^2).
- a(1) = 1, a(k) divides a(k+r) for all k and r and the ratios a(k+r)/a(k) are all different.A079854
a(1) = 1, a(k) divides a(k+r) for all k and r and the ratios a(k+r)/a(k) are all different.
- Duplicate of A048692.A079855
Duplicate of A048692.
- Duplicate of A073329.A079856
Duplicate of A073329.
- Number of positions that are exactly n moves from the starting position in the Rashkey Type 2 puzzle.A079857
Number of positions that are exactly n moves from the starting position in the Rashkey Type 2 puzzle.
- E.g.f. 1/(cos(2*x) - sin(2*x)).A079858
E.g.f. 1/(cos(2*x) - sin(2*x)).
- a(n) = n*2^(n-4).A079859
a(n) = n*2^(n-4).
- Duplicate of A061256.A079860
Duplicate of A061256.