Sequences
392,541 sequences
- Number of permutations p of [n] such that 1^p(1) + 2^p(2) + 3^p(3) + ... + n^p(n) is prime.A073111
Number of permutations p of [n] such that 1^p(1) + 2^p(2) + 3^p(3) + ... + n^p(n) is prime.
- Number of permutations p from (1,2,3,...,n) to (1,2,3,...,n) such that 1/(1+p(1)) + 1/(2+p(2)) + ... + 1/(n+p(n)) is an integer.A073112
Number of permutations p from (1,2,3,...,n) to (1,2,3,...,n) such that 1/(1+p(1)) + 1/(2+p(2)) + ... + 1/(n+p(n)) is an integer.
- a(n) = 2^(2^n + n).A073113
a(n) = 2^(2^n + n).
- Number of permutations p of [n] such that 1*p(1) + 2*p(2) + 3*p(3) + ... + n*p(n) is prime.A073114
Number of permutations p of [n] such that 1*p(1) + 2*p(2) + 3*p(3) + ... + n*p(n) is prime.
- Decimal expansion of sum(k>=0, 1/2^floor(k*phi) ) where phi = (1+sqrt(5))/2.A073115
Decimal expansion of sum(k>=0, 1/2^floor(k*phi) ) where phi = (1+sqrt(5))/2.
- Continued fraction expansion of S/2 where S = Sum_{k>=0} 1/2^floor(k*phi) (A073115) and phi is the golden ratio (1+sqrt(5))/2 (A001622).A073116
Continued fraction expansion of S/2 where S = Sum_{k>=0} 1/2^floor(k*phi) (A073115) and phi is the golden ratio (1+sqrt(5))/2 (A001622).
- a(n+1) = a(n) + a(n) mod n; a(1) = 1.A073117
a(n+1) = a(n) + a(n) mod n; a(1) = 1.
- Total sum of prime parts in all partitions of n.A073118
Total sum of prime parts in all partitions of n.
- Total number of parts which are positive powers of 2 in all partitions of n.A073119
Total number of parts which are positive powers of 2 in all partitions of n.
- Areas of Pythagorean (or right) triangles with integer sides of the form (2mn, m^2 - n^2, m^2 + n^2).A073120
Areas of Pythagorean (or right) triangles with integer sides of the form (2mn, m^2 - n^2, m^2 + n^2).
- a(n) = r*a(ceiling(n/2)) + s*a(floor(n/2)) with a(1)=1 and (r,s)=(2,2).A073121
a(n) = r*a(ceiling(n/2)) + s*a(floor(n/2)) with a(1)=1 and (r,s)=(2,2).
- Minimal reversing binary representation of n. Converting sum of powers of 2 in binary representation of a(n) to alternating sum gives n. See A072339.A073122
Minimal reversing binary representation of n. Converting sum of powers of 2 in binary representation of a(n) to alternating sum gives n. See A072339.
- a(n) is the largest number such that pi(a(n)) = prime(n).A073123
a(n) is the largest number such that pi(a(n)) = prime(n).
- a(n) = prime(1+prime(n)) - prime(prime(n)).A073124
a(n) = prime(1+prime(n)) - prime(prime(n)).
- a(n) is the least prime p(s) such that prime(s+n) - prime(s) is divisible by n.A073125
a(n) is the least prime p(s) such that prime(s+n) - prime(s) is divisible by n.
- a(n) is the least prime p(s) such that p(s) - p(s-n) is divisible by n, i.e., a(n) = p(s) = kn + p(s-n).A073126
a(n) is the least prime p(s) such that p(s) - p(s-n) is divisible by n, i.e., a(n) = p(s) = kn + p(s-n).
- a(n) is the quotient arising in A073125 [or in A073126]: a(n)=[A073126(n)-A073125(n)]/n=[p(s+n)-p(s)]/n.A073127
a(n) is the quotient arising in A073125 [or in A073126]: a(n)=[A073126(n)-A073125(n)]/n=[p(s+n)-p(s)]/n.
- Integer quotients arising in A063986.A073128
Integer quotients arising in A063986.
- Partial sums of cototients arising in A063986.A073129
Partial sums of cototients arising in A063986.
- a(n) = gcd(p(n+1) - p(n), p(p(n+1)) - p(p(n))), where p(n) is the n-th prime.A073130
a(n) = gcd(p(n+1) - p(n), p(p(n+1)) - p(p(n))), where p(n) is the n-th prime.
- a(n) = prime(prime(n+1)) - prime(prime(n)).A073131
a(n) = prime(prime(n+1)) - prime(prime(n)).
- Smallest subscript j such that d=p[p(j+1)]-p[p(j)]=2n, or 0 if j does not exist (at d=4).A073132
Smallest subscript j such that d=p[p(j+1)]-p[p(j)]=2n, or 0 if j does not exist (at d=4).
- Table by antidiagonals of T(n,k) = n*T(n,k-1) + T(n,k-2) starting with T(n,1) = 1.A073133
Table by antidiagonals of T(n,k) = n*T(n,k-1) + T(n,k-2) starting with T(n,1) = 1.
- Table by antidiagonals of T(n,k)=n*T(n,k-1)-T(n,k-2) starting with T(n,1)=1.A073134
Table by antidiagonals of T(n,k)=n*T(n,k-1)-T(n,k-2) starting with T(n,1)=1.
- Table by antidiagonals of T(n,k) = 2*n*T(n,k-1) - n^2*T(n,k-2) + T(n,k-4) starting with T(n,1) = 1.A073135
Table by antidiagonals of T(n,k) = 2*n*T(n,k-1) - n^2*T(n,k-2) + T(n,k-4) starting with T(n,1) = 1.
- a(n) = prime(n) + prime(prime(n)).A073136
a(n) = prime(n) + prime(prime(n)).
- a(n) is the least number whose binary representation has the same number of 0's and 1's as n.A073137
a(n) is the least number whose binary representation has the same number of 0's and 1's as n.
- Largest number having in its binary representation the same number of 0's and 1's as n.A073138
Largest number having in its binary representation the same number of 0's and 1's as n.
- Difference between the largest and smallest number having in binary representation the same number of 0's and 1's as n.A073139
Difference between the largest and smallest number having in binary representation the same number of 0's and 1's as n.
- Sum of the largest and smallest number having in binary representation the same number of 0's and 1's as n.A073140
Sum of the largest and smallest number having in binary representation the same number of 0's and 1's as n.
- Product of the largest and smallest number having in binary representation the same number of 0's and 1's as n.A073141
Product of the largest and smallest number having in binary representation the same number of 0's and 1's as n.
- List of smallest solutions for some k of x = f^k(x), n <> f^j(n) for j < k, where f: m -> |m - reverse(m)|.A073142
List of smallest solutions for some k of x = f^k(x), n <> f^j(n) for j < k, where f: m -> |m - reverse(m)|.
- Numbers k such that A073142(n) = f^k(A073142(n)), where f: m -> |m - reverse(m)|.A073143
Numbers k such that A073142(n) = f^k(A073142(n)), where f: m -> |m - reverse(m)|.
- Smallest m such that the 'Reverse and Subtract' trajectory (cf. A072137) of m leads to A073142(n).A073144
Smallest m such that the 'Reverse and Subtract' trajectory (cf. A072137) of m leads to A073142(n).
- a(n) = -a(n-1) - a(n-2) + a(n-3), a(0)=3, a(1)=-1, a(2)=-1.A073145
a(n) = -a(n-1) - a(n-2) + a(n-3), a(0)=3, a(1)=-1, a(2)=-1.
- Triangle of numbers {a(n,k), n >= 0, 0 <= k <= n} defined by a(0,0)=1, a(n,0)=A000670(n), a(n,n)=A000629(n), a(n,k) = a(n,k-1) + a(n-1,k-1); a(n+1,0) = Sum_{k=0..n} a(n,k).A073146
Triangle of numbers {a(n,k), n >= 0, 0 <= k <= n} defined by a(0,0)=1, a(n,0)=A000670(n), a(n,n)=A000629(n), a(n,k) = a(n,k-1) + a(n-1,k-1); a(n+1,0) = Sum_{k=0..n} a(n,k).
- Triangle of numbers {a(n,k), n >= 0, 0<=k<=n} defined by a(0,0)=1, a(n,0)=A001764(n), a(n,n)=A006013(n), a(n,n-1)=A006629(n-1).A073147
Triangle of numbers {a(n,k), n >= 0, 0<=k<=n} defined by a(0,0)=1, a(n,0)=A001764(n), a(n,n)=A006013(n), a(n,n-1)=A006629(n-1).
- Triangle of numbers {a(n,k), n >= 0, 0<=k<=n} defined by a(0,0)=1, a(n,0)=A006013(n), a(n+1,n)=A001764(n+1), a(n,m) = Sum A001764(n-k)*a(n,k), k=0..m.A073148
Triangle of numbers {a(n,k), n >= 0, 0<=k<=n} defined by a(0,0)=1, a(n,0)=A006013(n), a(n+1,n)=A001764(n+1), a(n,m) = Sum A001764(n-k)*a(n,k), k=0..m.
- Triangle of numbers arising in recursive computation of A002212.A073149
Triangle of numbers arising in recursive computation of A002212.
- Triangle of numbers {a(n,k), n >= 0, 0<=k<=n} defined by a(0,0)=1, a(1,0)=2, a(n,0)=A006318(n), a(n,n)=A006319(n), a(n+1,0)=a(n,0)+a(n,n), a(n,m+1)= Sum A006318(k)*a(n-k,0), k=0..m.A073150
Triangle of numbers {a(n,k), n >= 0, 0<=k<=n} defined by a(0,0)=1, a(1,0)=2, a(n,0)=A006318(n), a(n,n)=A006319(n), a(n+1,0)=a(n,0)+a(n,n), a(n,m+1)= Sum A006318(k)*a(n-k,0), k=0..m.
- Triangle of numbers {a(n,k), n >= 0, 0<=k<=n} defined by a(0,0)=1, a(n+1,0)=A006319(n)=a(n,0) + Sum a(k,k), k=0..n-1. a(n,m+1)= a(n,0) + Sum A006319(k)*a(n-k-1,0), k=0..m-1.A073151
Triangle of numbers {a(n,k), n >= 0, 0<=k<=n} defined by a(0,0)=1, a(n+1,0)=A006319(n)=a(n,0) + Sum a(k,k), k=0..n-1. a(n,m+1)= a(n,0) + Sum A006319(k)*a(n-k-1,0), k=0..m-1.
- Triangle of numbers relating two simple context-free grammars (A052709 and A052705).A073152
Triangle of numbers relating two simple context-free grammars (A052709 and A052705).
- Triangle of numbers relating two sequences A073155 and A073156.A073153
Triangle of numbers relating two sequences A073155 and A073156.
- Triangle of numbers relating two sequences (A073157 and A073155).A073154
Triangle of numbers relating two sequences (A073157 and A073155).
- Leftmost column sequence of triangle A073153.A073155
Leftmost column sequence of triangle A073153.
- Main diagonal sequence of triangle A073153.A073156
Main diagonal sequence of triangle A073153.
- Number of Schroeder n-paths containing no FFs.A073157
Number of Schroeder n-paths containing no FFs.
- a() = 1,2,4,7,... [ A073158 ], adjacent sums = 3,6,11... [ A073159 ] and 2nd adjacent sums = 9,17,... [ A073160 ] are disjoint but not monotonic; adjoin next free number to A073158 to construct three sequences that together include all positive integers.A073158
a() = 1,2,4,7,... [ A073158 ], adjacent sums = 3,6,11... [ A073159 ] and 2nd adjacent sums = 9,17,... [ A073160 ] are disjoint but not monotonic; adjoin next free number to A073158 to construct three sequences that together include all positive integers.
- Sums of adjacent terms of A073158. Together, A073158, A073159 and A073160 include all the positive integers uniquely.A073159
Sums of adjacent terms of A073158. Together, A073158, A073159 and A073160 include all the positive integers uniquely.
- Sums of adjacent terms of A073159. Together, A073158, A073159 and A073160 include all the positive integers uniquely.A073160
Sums of adjacent terms of A073159. Together, A073158, A073159 and A073160 include all the positive integers uniquely.