Sequences
392,541 sequences
- Numbers n such that n is a sum of 2 squares (i.e., n is in A001481(k)) and sigma(n) == 0 (mod 4).A071011
Numbers n such that n is a sum of 2 squares (i.e., n is in A001481(k)) and sigma(n) == 0 (mod 4).
- a(1)=1, a(n) is the smallest number >= a(n-1) such that the simple continued fraction for S(n) = 1/a(1) + 1/a(2) + ... + 1/a(n) contains exactly n elements.A071012
a(1)=1, a(n) is the smallest number >= a(n-1) such that the simple continued fraction for S(n) = 1/a(1) + 1/a(2) + ... + 1/a(n) contains exactly n elements.
- a(0)=1, a(n) is the smallest number > a(n-1) such that the simple continued fraction for S(n)=1/a(0)+1/a(1)+...+1/a(n) contains exactly 2n elements.A071013
a(0)=1, a(n) is the smallest number > a(n-1) such that the simple continued fraction for S(n)=1/a(0)+1/a(1)+...+1/a(n) contains exactly 2n elements.
- Binomial transform of A002487.A071014
Binomial transform of A002487.
- Inverse binomial transform of A002487.A071015
Inverse binomial transform of A002487.
- Stirling_2 transform of A002487.A071016
Stirling_2 transform of A002487.
- Moebius transform of A002487.A071017
Moebius transform of A002487.
- Inverse Moebius transform of A002487.A071018
Inverse Moebius transform of A002487.
- Euler transform of A002487.A071019
Euler transform of A002487.
- Square array T(i,j) = Bernoulli(2i)*Bernoulli(2j) read by antidiagonals: numerators.A071020
Square array T(i,j) = Bernoulli(2i)*Bernoulli(2j) read by antidiagonals: numerators.
- Square array T(i,j) = Bernoulli(2i)*Bernoulli(2j) read by antidiagonals: denominators.A071021
Square array T(i,j) = Bernoulli(2i)*Bernoulli(2j) read by antidiagonals: denominators.
- Triangle read by rows giving successive states of cellular automaton generated by "Rule 70" and by "Rule 198".A071022
Triangle read by rows giving successive states of cellular automaton generated by "Rule 70" and by "Rule 198".
- Triangle read by rows giving successive states of cellular automaton generated by "Rule 78".A071023
Triangle read by rows giving successive states of cellular automaton generated by "Rule 78".
- Triangle read by rows giving successive states of cellular automaton generated by "Rule 92".A071024
Triangle read by rows giving successive states of cellular automaton generated by "Rule 92".
- Triangle read by rows giving successive states of cellular automaton generated by "Rule 124".A071025
Triangle read by rows giving successive states of cellular automaton generated by "Rule 124".
- Triangle read by rows giving successive states of cellular automaton generated by "Rule 188".A071026
Triangle read by rows giving successive states of cellular automaton generated by "Rule 188".
- Triangle read by rows giving successive states of cellular automaton generated by "Rule 230".A071027
Triangle read by rows giving successive states of cellular automaton generated by "Rule 230".
- Triangle read by rows giving successive states of cellular automaton generated by "Rule 50".A071028
Triangle read by rows giving successive states of cellular automaton generated by "Rule 50".
- Triangle read by rows giving successive states of cellular automaton generated by "Rule 22".A071029
Triangle read by rows giving successive states of cellular automaton generated by "Rule 22".
- Triangle read by rows giving successive states of cellular automaton generated by "Rule 54".A071030
Triangle read by rows giving successive states of cellular automaton generated by "Rule 54".
- Triangle read by rows giving successive states of cellular automaton generated by "Rule 62".A071031
Triangle read by rows giving successive states of cellular automaton generated by "Rule 62".
- Triangle read by rows giving successive states of cellular automaton generated by "Rule 86".A071032
Triangle read by rows giving successive states of cellular automaton generated by "Rule 86".
- a(n) = n-th state of cellular automaton generated by "Rule 94" when started with a single ON cell.A071033
a(n) = n-th state of cellular automaton generated by "Rule 94" when started with a single ON cell.
- Triangle read by rows giving successive states of cellular automaton generated by "Rule 118".A071034
Triangle read by rows giving successive states of cellular automaton generated by "Rule 118".
- Triangle read by rows giving successive states of cellular automaton generated by "Rule 126".A071035
Triangle read by rows giving successive states of cellular automaton generated by "Rule 126".
- Triangle read by rows giving successive states of cellular automaton generated by "Rule 150" when started with a single ON cell.A071036
Triangle read by rows giving successive states of cellular automaton generated by "Rule 150" when started with a single ON cell.
- Triangle read by rows giving successive states of cellular automaton generated by "Rule 158".A071037
Triangle read by rows giving successive states of cellular automaton generated by "Rule 158".
- Triangle read by rows giving successive states of cellular automaton generated by "Rule 182".A071038
Triangle read by rows giving successive states of cellular automaton generated by "Rule 182".
- Corrected version is duplicate of A118111.A071039
Corrected version is duplicate of A118111.
- Triangle read by rows giving successive states of cellular automaton generated by "Rule 214".A071040
Triangle read by rows giving successive states of cellular automaton generated by "Rule 214".
- Triangle read by rows giving successive states of cellular automaton generated by "Rule 246".A071041
Triangle read by rows giving successive states of cellular automaton generated by "Rule 246".
- Number of 0's in n-th row of triangle in A070886.A071042
Number of 0's in n-th row of triangle in A070886.
- Number of 0's in n-th row of triangle in A071029.A071043
Number of 0's in n-th row of triangle in A071029.
- Number of ON cells at generation n of 1-D CA defined by Rule 22, starting with a single ON cell.A071044
Number of ON cells at generation n of 1-D CA defined by Rule 22, starting with a single ON cell.
- Number of 0's in n-th row of triangle in A071030.A071045
Number of 0's in n-th row of triangle in A071030.
- Number of 0's in n-th row of triangle in A071031, cellular automaton "rule 62".A071046
Number of 0's in n-th row of triangle in A071031, cellular automaton "rule 62".
- Number of 1's in n-th row of triangle in A071031, cellular automaton "rule 62".A071047
Number of 1's in n-th row of triangle in A071031, cellular automaton "rule 62".
- Number of 0's in n-th row of triangle in A070887.A071048
Number of 0's in n-th row of triangle in A070887.
- Number of 1's in n-th generation of 1-D CA using Rule 110, started with a single 1.A071049
Number of 1's in n-th generation of 1-D CA using Rule 110, started with a single 1.
- Number of 0's in n-th row of triangle in A071035.A071050
Number of 0's in n-th row of triangle in A071035.
- Number of 1's in n-th row of triangle in A071035.A071051
Number of 1's in n-th row of triangle in A071035.
- Number of 0's in n-th row of triangle in A071036 (cellular automaton "Rule 150").A071052
Number of 0's in n-th row of triangle in A071036 (cellular automaton "Rule 150").
- Number of ON cells at n-th generation of 1-D CA defined by Rule 150, starting with a single ON cell at generation 0.A071053
Number of ON cells at n-th generation of 1-D CA defined by Rule 150, starting with a single ON cell at generation 0.
- a(2n)=3n+1, a(2n+1)=2n+2.A071054
a(2n)=3n+1, a(2n+1)=2n+2.
- Number of 0's in n-th row of triangle in A071038.A071055
Number of 0's in n-th row of triangle in A071038.
- Smallest number m such that m = p(i) mod p(i)^2 for 1<=i<=n.A071056
Smallest number m such that m = p(i) mod p(i)^2 for 1<=i<=n.
- Smallest number m such that m = p(i+1) mod p(i) for 1<=i<=n.A071057
Smallest number m such that m = p(i+1) mod p(i) for 1<=i<=n.
- Number of ways of pairing odd numbers in the range 1 to n with even numbers in the range n+1 to 2n such that each pair sums to a prime.A071058
Number of ways of pairing odd numbers in the range 1 to n with even numbers in the range n+1 to 2n such that each pair sums to a prime.
- Number of ways of pairing even numbers in the range 1 to n with odd numbers in the range n+1 to 2n such that each pair sums to a prime.A071059
Number of ways of pairing even numbers in the range 1 to n with odd numbers in the range n+1 to 2n such that each pair sums to a prime.
- Largest n-digit prime with only prime digits.A071060
Largest n-digit prime with only prime digits.