Sequences
392,541 sequences
- a(n) = floor((n+2)^(n+2)/n^n).A078111
a(n) = floor((n+2)^(n+2)/n^n).
- Coefficients a(n) in the unique expansion sin(1) = Sum[a(n)/n!, n>=1], where a(n) satisfies 0<=a(n)<n.A078112
Coefficients a(n) in the unique expansion sin(1) = Sum[a(n)/n!, n>=1], where a(n) satisfies 0<=a(n)<n.
- Let u(1)=u(2)=1, u(3)=n, u(k) = (1/2)*abs(2*u(k-1) -u(k-2)-u(k-3)); sequence gives values of n such that Sum_{k>=1} u(k) is an integer.A078113
Let u(1)=u(2)=1, u(3)=n, u(k) = (1/2)*abs(2*u(k-1) -u(k-2)-u(k-3)); sequence gives values of n such that Sum_{k>=1} u(k) is an integer.
- Pinomial primes of order 4: primes of the form 3*x^4 + 1*x^3 + 4*x^2 + 1*x + 5, x a positive integer.A078114
Pinomial primes of order 4: primes of the form 3*x^4 + 1*x^3 + 4*x^2 + 1*x + 5, x a positive integer.
- Enomial primes of order 6: primes of the form 2*x^6 + 7*x^5 + 1*x^4 + 8*x^3 + 2*x^2 + 8*x + 1 for positive integer x.A078115
Enomial primes of order 6: primes of the form 2*x^6 + 7*x^5 + 1*x^4 + 8*x^3 + 2*x^2 + 8*x + 1 for positive integer x.
- Primes of the form x^2 + 2y^2 where y<=x. Terms are listed in increasing order of x; for fixed x they're in increasing order of y.A078116
Primes of the form x^2 + 2y^2 where y<=x. Terms are listed in increasing order of x; for fixed x they're in increasing order of y.
- Let u(1)=n, u(2)=n+1, v(1)=n+2, v(2)=n+3, u(k)=abs(u(k-1)-v(k-2)), v(k)=abs(v(k-1)-u(k-2)), then a(n) is the smallest integer such that for any k>=a(n), v(k)=u(k).A078117
Let u(1)=n, u(2)=n+1, v(1)=n+2, v(2)=n+3, u(k)=abs(u(k-1)-v(k-2)), v(k)=abs(v(k-1)-u(k-2)), then a(n) is the smallest integer such that for any k>=a(n), v(k)=u(k).
- n+1 does not divide sigma(n!).A078118
n+1 does not divide sigma(n!).
- a(n) = sigma(n) - phi(n+2), where sigma = sum of divisors (A000203) and phi = Euler totient function (A000010).A078119
a(n) = sigma(n) - phi(n+2), where sigma = sum of divisors (A000203) and phi = Euler totient function (A000010).
- Number of distinct prime divisors of n-th balanced number.A078120
Number of distinct prime divisors of n-th balanced number.
- Infinite lower triangular matrix, M, that satisfies [M^2](i,j) = M(i+1,j+1) for all i,j>=0 where [M^n](i,j) denotes the element at row i, column j, of the n-th power of matrix M, with M(0,k)=1 and M(k,k)=1 for all k>=0.A078121
Infinite lower triangular matrix, M, that satisfies [M^2](i,j) = M(i+1,j+1) for all i,j>=0 where [M^n](i,j) denotes the element at row i, column j, of the n-th power of matrix M, with M(0,k)=1 and M(k,k)=1 for all k>=0.
- Infinite lower triangular matrix, M, that satisfies [M^3](i,j) = M(i+1,j+1) for all i,j>=0 where [M^n](i,j) denotes the element at row i, column j, of the n-th power of matrix M, with M(0,k)=1 and M(k,k)=1 for all k>=0.A078122
Infinite lower triangular matrix, M, that satisfies [M^3](i,j) = M(i+1,j+1) for all i,j>=0 where [M^n](i,j) denotes the element at row i, column j, of the n-th power of matrix M, with M(0,k)=1 and M(k,k)=1 for all k>=0.
- Square of infinite lower triangular matrix A078122.A078123
Square of infinite lower triangular matrix A078122.
- Second column, M(n+1,1) for n>=0, of infinite lower triangular matrix M defined in A078122.A078124
Second column, M(n+1,1) for n>=0, of infinite lower triangular matrix M defined in A078122.
- Number of partitions of 3^n into powers of 3.A078125
Number of partitions of 3^n into powers of 3.
- Negative determinant of n X n matrix M_{i,j}=1 if i=j or i+j=1 (mod 2).A078126
Negative determinant of n X n matrix M_{i,j}=1 if i=j or i+j=1 (mod 2).
- Decimal expansion of DirichletBeta'(1).A078127
Decimal expansion of DirichletBeta'(1).
- Number of ways to write n as sum of cubes > 1.A078128
Number of ways to write n as sum of cubes > 1.
- Numbers which cannot be written as sum of cubes > 1.A078129
Numbers which cannot be written as sum of cubes > 1.
- Numbers having exactly one representation as sum of cubes > 1.A078130
Numbers having exactly one representation as sum of cubes > 1.
- Numbers which can be written as sum of cubes > 1.A078131
Numbers which can be written as sum of cubes > 1.
- Primes which can be written as sum of cubes > 1.A078132
Primes which can be written as sum of cubes > 1.
- Primes which cannot be written as sum of cubes>1.A078133
Primes which cannot be written as sum of cubes>1.
- Number of ways to write n as sum of squares > 1.A078134
Number of ways to write n as sum of squares > 1.
- Numbers which cannot be written as a sum of squares > 1.A078135
Numbers which cannot be written as a sum of squares > 1.
- Numbers having exactly one representation as sum of squares>1.A078136
Numbers having exactly one representation as sum of squares>1.
- Numbers which can be written as sum of squares>1.A078137
Numbers which can be written as sum of squares>1.
- Primes which can be written as sum of squares > 1.A078138
Primes which can be written as sum of squares > 1.
- Primes which cannot be written as sum of squares>1.A078139
Primes which cannot be written as sum of squares>1.
- Convolutory inverse of signed lower Wythoff sequence.A078140
Convolutory inverse of signed lower Wythoff sequence.
- a(n) = floor(exp(n - gamma)), where gamma is Euler's constant.A078141
a(n) = floor(exp(n - gamma)), where gamma is Euler's constant.
- a(n) is the sum of the differences of the distinct prime factors p of n and the next square larger than p.A078142
a(n) is the sum of the differences of the distinct prime factors p of n and the next square larger than p.
- Smallest term of a run of at least 9 consecutive integers which are not squarefree.A078143
Smallest term of a run of at least 9 consecutive integers which are not squarefree.
- Starts for strings of at least five consecutive nonsquarefree numbers.A078144
Starts for strings of at least five consecutive nonsquarefree numbers.
- Length of period of continued fraction for square root of 1+n!.A078145
Length of period of continued fraction for square root of 1+n!.
- Length of period of continued fraction for square root of -1 + n!.A078146
Length of period of continued fraction for square root of -1 + n!.
- First differences of sequence of nonsquarefree numbers, A013929.A078147
First differences of sequence of nonsquarefree numbers, A013929.
- Numbers k such that d(phi(k)) = phi(d(k)), where d=A000005 and phi=A000010.A078148
Numbers k such that d(phi(k)) = phi(d(k)), where d=A000005 and phi=A000010.
- See A078606 for the official version of this sequence.A078149
See A078606 for the official version of this sequence.
- Smallest k such that d(phi(k)) - phi(d(k)) = n, where d(k) = A000005(k) and phi(k) = A000010(k).A078150
Smallest k such that d(phi(k)) - phi(d(k)) = n, where d(k) = A000005(k) and phi(k) = A000010(k).
- Smallest k such that d(phi(k)) - phi(d(k)) = -n, where d(k) = A000005(k) and phi(k) = A000010(k).A078151
Smallest k such that d(phi(k)) - phi(d(k)) = -n, where d(k) = A000005(k) and phi(k) = A000010(k).
- a(n) = A055086(n) - A000005(n).A078152
a(n) = A055086(n) - A000005(n).
- a(n) = A051201(n) - A000203(n).A078153
a(n) = A051201(n) - A000203(n).
- Primes of the form A004154(k) + 1.A078154
Primes of the form A004154(k) + 1.
- A078152(n!).A078155
A078152(n!).
- A078153(n!).A078156
A078153(n!).
- a(n) = A078152(2^n).A078157
a(n) = A078152(2^n).
- a(n) = A078153(2^n).A078158
a(n) = A078153(2^n).
- a(n) = A055086(2^n).A078159
a(n) = A055086(2^n).
- a(n) = A055086(n!).A078160
a(n) = A055086(n!).