Sequences
392,541 sequences
- Triangle of all possible distinct numbers obtained as a product of distinct numbers from 1..n.A070861
Triangle of all possible distinct numbers obtained as a product of distinct numbers from 1..n.
- Number of path covers of an n X n grid.A070862
Number of path covers of an n X n grid.
- Sum of numbers in n-th row of A070861.A070863
Sum of numbers in n-th row of A070861.
- a(1) = a(2) = 1; a(n) = 2 + a(n - a(n-1)).A070864
a(1) = a(2) = 1; a(n) = 2 + a(n - a(n-1)).
- Smallest prime such that the difference of successive terms is strictly increasing.A070865
Smallest prime such that the difference of successive terms is strictly increasing.
- Smallest prime such that the difference of successive terms is nondecreasing.A070866
Smallest prime such that the difference of successive terms is nondecreasing.
- a(1) = a(2) = 1; a(n) = a(n-1 - a(n-1)) + a(n-1 - a(n-2)).A070867
a(1) = a(2) = 1; a(n) = a(n-1 - a(n-1)) + a(n-1 - a(n-2)).
- a(1) = a(2) = 1; a(n) = a(a(n-1)) + a(n+1 - 2*a(n-1)).A070868
a(1) = a(2) = 1; a(n) = a(a(n-1)) + a(n+1 - 2*a(n-1)).
- a(1) = 16; a(n+1) = sum of a(n) and (a(n) written in base 2 and reversed).A070869
a(1) = 16; a(n+1) = sum of a(n) and (a(n) written in base 2 and reversed).
- a(1) = 6; a(n+1) = (a(n)+1)/2 if a(n) odd, or 5*a(n)/2 if a(n) even.A070870
a(1) = 6; a(n+1) = (a(n)+1)/2 if a(n) odd, or 5*a(n)/2 if a(n) even.
- a(n) = A002487(n) * A002487(n+1) (Conway's alimentary function).A070871
a(n) = A002487(n) * A002487(n+1) (Conway's alimentary function).
- Numbers k such that A070871(k) = k.A070872
Numbers k such that A070871(k) = k.
- A070871(n) > n.A070873
A070871(n) > n.
- A070871(n) < n.A070874
A070871(n) < n.
- Binary expansion is 1x100...0 where x = 0 or 1.A070875
Binary expansion is 1x100...0 where x = 0 or 1.
- Binary expansion is 1xx100...0 where xx = 00 or 11.A070876
Binary expansion is 1xx100...0 where xx = 00 or 11.
- Expansion of Product_{k>=1} (1 - 2x^k).A070877
Expansion of Product_{k>=1} (1 - 2x^k).
- Stern's diatomic array read by rows (version 2).A070878
Stern's diatomic array read by rows (version 2).
- Stern's diatomic array read by rows (version 3 - same as version 2, A070878, but with final 0 in each row omitted).A070879
Stern's diatomic array read by rows (version 3 - same as version 2, A070878, but with final 0 in each row omitted).
- Consider the 2^(n-1)-1 nonempty subsets S of {1, 2, ..., n-1}; a(n) gives number of such S for which it is impossible to partition n into parts from S such that each s in S is used at least once.A070880
Consider the 2^(n-1)-1 nonempty subsets S of {1, 2, ..., n-1}; a(n) gives number of such S for which it is impossible to partition n into parts from S such that each s in S is used at least once.
- Least k such that A070868(k) = n.A070881
Least k such that A070868(k) = n.
- Least k such that A070867(k) = n, or 0 if no such k exists.A070882
Least k such that A070867(k) = n, or 0 if no such k exists.
- Bitwise XOR of n and n-th prime.A070883
Bitwise XOR of n and n-th prime.
- 7 + x where x is congruent to {0, 4, 6, 10, 12, 16, 22, 24} mod 30.A070884
7 + x where x is congruent to {0, 4, 6, 10, 12, 16, 22, 24} mod 30.
- a(n) = (3/2)*a(n-1) if a(n-1) is even; (3/2)*(a(n-1)+1) if a(n-1) is odd.A070885
a(n) = (3/2)*a(n-1) if a(n-1) is even; (3/2)*(a(n-1)+1) if a(n-1) is odd.
- Triangle read by rows giving successive states of cellular automaton generated by "Rule 90".A070886
Triangle read by rows giving successive states of cellular automaton generated by "Rule 90".
- Triangle read by rows giving successive states of one-dimensional cellular automaton generated by "Rule 110".A070887
Triangle read by rows giving successive states of one-dimensional cellular automaton generated by "Rule 110".
- Numerator of Sum_{k=1..n} mu(k)/k.A070888
Numerator of Sum_{k=1..n} mu(k)/k.
- Denominator of Sum_{k=1..n} mu(k)/k.A070889
Denominator of Sum_{k=1..n} mu(k)/k.
- Numerator of Sum_{k=1..n} mu(k)/k when it changes sign.A070890
Numerator of Sum_{k=1..n} mu(k)/k when it changes sign.
- Denominator of Sum_{k=1..n} mu(k)/k when it changes sign.A070891
Denominator of Sum_{k=1..n} mu(k)/k when it changes sign.
- Numbers n such that absolute value of Sum_{k=1..n} mu(k)/k sets a new minimum.A070892
Numbers n such that absolute value of Sum_{k=1..n} mu(k)/k sets a new minimum.
- Let r, s, t be three permutations of the set {1,2,3,..,n}; a(n) = value of Sum_{i=1..n} r(i)*s(i)*t(i), with r={1,2,3,..,n}; s={n,n-1,..,1} and t={n,n-2,n-4,...,1,...,n-3,n-1}.A070893
Let r, s, t be three permutations of the set {1,2,3,..,n}; a(n) = value of Sum_{i=1..n} r(i)*s(i)*t(i), with r={1,2,3,..,n}; s={n,n-1,..,1} and t={n,n-2,n-4,...,1,...,n-3,n-1}.
- Number of nonempty subsets of the set of vertices of a regular n-gon in the plane such that their center of gravity is the center of the polygon.A070894
Number of nonempty subsets of the set of vertices of a regular n-gon in the plane such that their center of gravity is the center of the polygon.
- Triangle read by rows where T(n+1,k)=T(n,k)+n*T(n-1,k) starting with T(n,n)=1 and T(n,k)=0 if n<k.A070895
Triangle read by rows where T(n+1,k)=T(n,k)+n*T(n-1,k) starting with T(n,n)=1 and T(n,k)=0 if n<k.
- Determinant of the Cayley addition table of Z_{n}.A070896
Determinant of the Cayley addition table of Z_{n}.
- Number of ways of pairing numbers 1 to n with numbers n+1 to 2n such that each pair sums to a prime.A070897
Number of ways of pairing numbers 1 to n with numbers n+1 to 2n such that each pair sums to a prime.
- a(0)=1, a(n) is the smallest integer > a(n-1) such that the largest element in the simple continued fraction for S(n)= 1/a(0)+1/a(1)+1/a(2)+...+1/a(n) equals 2n.A070898
a(0)=1, a(n) is the smallest integer > a(n-1) such that the largest element in the simple continued fraction for S(n)= 1/a(0)+1/a(1)+1/a(2)+...+1/a(n) equals 2n.
- a(1)=1, a(n) is the smallest integer > a(n-1) such that the largest element in the simple continued fraction for S(n)=1/a(1)+1/a(2)+...+1/a(n) equals 3n.A070899
a(1)=1, a(n) is the smallest integer > a(n-1) such that the largest element in the simple continued fraction for S(n)=1/a(1)+1/a(2)+...+1/a(n) equals 3n.
- a(0)=1, a(n) is the smallest integer >= a(n-1) such that the largest element in the simple continued fraction for S(n)=1/a(0)+1/a(1)+1/a(2)+...+1/a(n) equals the number of elements in this continued fraction.A070900
a(0)=1, a(n) is the smallest integer >= a(n-1) such that the largest element in the simple continued fraction for S(n)=1/a(0)+1/a(1)+1/a(2)+...+1/a(n) equals the number of elements in this continued fraction.
- a(1)=1, a(n) is the smallest integer > a(n-1) such that the largest element in the simple continued fraction for S(n)=1/a(1)+1/a(2)+...+1/a(n) equals prime(n).A070901
a(1)=1, a(n) is the smallest integer > a(n-1) such that the largest element in the simple continued fraction for S(n)=1/a(1)+1/a(2)+...+1/a(n) equals prime(n).
- a(1)=1, a(n) is the smallest integer > a(n-1) such that the largest element in the simple continued fraction for S(n)=1/a(1)+1/a(2)+...+1/a(n) equals n^2.A070902
a(1)=1, a(n) is the smallest integer > a(n-1) such that the largest element in the simple continued fraction for S(n)=1/a(1)+1/a(2)+...+1/a(n) equals n^2.
- a(1)=1, a(n) is the smallest integer > a(n-1) such that the largest element in the simple continued fraction for S(n)=1/a(1)+1/a(2)+...+1/a(n) equals n^3.A070903
a(1)=1, a(n) is the smallest integer > a(n-1) such that the largest element in the simple continued fraction for S(n)=1/a(1)+1/a(2)+...+1/a(n) equals n^3.
- a(1) = 1, a(n) is the smallest integer > a(n-1) such that the largest element in the simple continued fraction for S(n) = 1/a(1) + 1/a(2) + ... + 1/a(n) equals n^4.A070904
a(1) = 1, a(n) is the smallest integer > a(n-1) such that the largest element in the simple continued fraction for S(n) = 1/a(1) + 1/a(2) + ... + 1/a(n) equals n^4.
- Smallest prime (emirp) of n consecutive primes such that all are emirps and all have the same digital sum.A070905
Smallest prime (emirp) of n consecutive primes such that all are emirps and all have the same digital sum.
- Every third Bell number A000110.A070906
Every third Bell number A000110.
- Every fourth Bell number A000110.A070907
Every fourth Bell number A000110.
- Every fifth Bell number A000110.A070908
Every fifth Bell number A000110.
- Triangle read by rows giving successive states of cellular automaton generated by "Rule 28" and by "Rule 156".A070909
Triangle read by rows giving successive states of cellular automaton generated by "Rule 28" and by "Rule 156".
- Decimal expansion of BesselI(0,2).A070910
Decimal expansion of BesselI(0,2).