Sequences
392,541 sequences
- a(n) = n^2 + 5*n + 1.A082111
a(n) = n^2 + 5*n + 1.
- a(n) = 4*n^2 + 10*n + 1.A082112
a(n) = 4*n^2 + 10*n + 1.
- a(n) = n^4 + 5*n^2 + 1.A082113
a(n) = n^4 + 5*n^2 + 1.
- Diagonal sums of number array A082110.A082114
Diagonal sums of number array A082110.
- Fibonacci sequence (mod 3).A082115
Fibonacci sequence (mod 3).
- Fibonacci sequence (mod 5).A082116
Fibonacci sequence (mod 5).
- Fibonacci sequence (mod 6).A082117
Fibonacci sequence (mod 6).
- Duplicate of A079344.A082118
Duplicate of A079344.
- Smallest positive difference between d and n/d for any divisor d of n.A082119
Smallest positive difference between d and n/d for any divisor d of n.
- Smallest difference > 1 between d and n/d for any divisor d of n.A082120
Smallest difference > 1 between d and n/d for any divisor d of n.
- Smallest difference > 1 between d and p/d for any divisor d of the partial product p of the sequence, starting with 7.A082121
Smallest difference > 1 between d and p/d for any divisor d of the partial product p of the sequence, starting with 7.
- Smallest difference > 1 between d and p/d for any divisor d of the partial product p of the sequence, starting with 11.A082122
Smallest difference > 1 between d and p/d for any divisor d of the partial product p of the sequence, starting with 11.
- Smallest difference > 1 between d and p/d for any divisor d of the partial product p of the sequence, starting with 17.A082123
Smallest difference > 1 between d and p/d for any divisor d of the partial product p of the sequence, starting with 17.
- Smallest difference>1 between d and p/d for any divisor d of the partial product p of the sequence, starting with 9.A082124
Smallest difference>1 between d and p/d for any divisor d of the partial product p of the sequence, starting with 9.
- Smallest difference>1 between d and p/d for any divisor d of the partial product p of the sequence, starting with 4.A082125
Smallest difference>1 between d and p/d for any divisor d of the partial product p of the sequence, starting with 4.
- Smallest difference>1 between d and p/d for any divisor d of the partial product p of the sequence, starting with 19.A082126
Smallest difference>1 between d and p/d for any divisor d of the partial product p of the sequence, starting with 19.
- Rounded base-3 logarithm of A082126(n).A082127
Rounded base-3 logarithm of A082126(n).
- Smallest difference>1 between d and p/d for any divisor d of the partial product p of the sequence, starting with 21.A082128
Smallest difference>1 between d and p/d for any divisor d of the partial product p of the sequence, starting with 21.
- Rounded base-2 logarithm of A082128(n).A082129
Rounded base-2 logarithm of A082128(n).
- Numbers k such that 2*k-1 and 2*k+1 are semiprimes.A082130
Numbers k such that 2*k-1 and 2*k+1 are semiprimes.
- Middle of semiprime triple: n-2, n, n+2 are semiprimes.A082131
Middle of semiprime triple: n-2, n, n+2 are semiprimes.
- a(0) = 5; for n > 0, a(n) is the greatest prime factor of PP(a(n-1))*a(n-1)-2 where PP(n) is an abbreviation for PreviousPrime(n).A082132
a(0) = 5; for n > 0, a(n) is the greatest prime factor of PP(a(n-1))*a(n-1)-2 where PP(n) is an abbreviation for PreviousPrime(n).
- Expansion of e.g.f. x*exp(2*x)*cosh(x).A082133
Expansion of e.g.f. x*exp(2*x)*cosh(x).
- Expansion of e.g.f. x*exp(3*x)*cosh(x).A082134
Expansion of e.g.f. x*exp(3*x)*cosh(x).
- Expansion of e.g.f. x*exp(4*x)*cosh(x).A082135
Expansion of e.g.f. x*exp(4*x)*cosh(x).
- Expansion of e.g.f. x*exp(5*x)*cosh(x).A082136
Expansion of e.g.f. x*exp(5*x)*cosh(x).
- Square array of transforms of binomial coefficients, read by antidiagonals.A082137
Square array of transforms of binomial coefficients, read by antidiagonals.
- A transform of C(n,3).A082138
A transform of C(n,3).
- A transform of binomial(n,5).A082139
A transform of binomial(n,5).
- A transform of binomial(n,6).A082140
A transform of binomial(n,6).
- A transform of C(n,7).A082141
A transform of C(n,7).
- Duplicate of A069723.A082142
Duplicate of A069723.
- First subdiagonal of number array A082137.A082143
First subdiagonal of number array A082137.
- A subdiagonal of number array A082137.A082144
A subdiagonal of number array A082137.
- A subdiagonal of number array A082137.A082145
A subdiagonal of number array A082137.
- Expansion of g.f.: (1+x^5)/((1-x^2)*(1-x^3)*(1-x^4)*(1-x^6)).A082146
Expansion of g.f.: (1+x^5)/((1-x^2)*(1-x^3)*(1-x^4)*(1-x^6)).
- a(0)=1; for n >= 1, a(n) = Sum_{k=0..n} 8^k*N(n,k) where N(n,k) = (1/n)*C(n,k)*C(n,k+1) are the Narayana numbers (A001263).A082147
a(0)=1; for n >= 1, a(n) = Sum_{k=0..n} 8^k*N(n,k) where N(n,k) = (1/n)*C(n,k)*C(n,k+1) are the Narayana numbers (A001263).
- a(0)=1; for n >= 1, a(n) = Sum_{k=0..n} 10^k*N(n,k), where N(n,k) = (1/n)*C(n,k)*C(n,k+1) are the Narayana numbers (A001263).A082148
a(0)=1; for n >= 1, a(n) = Sum_{k=0..n} 10^k*N(n,k), where N(n,k) = (1/n)*C(n,k)*C(n,k+1) are the Narayana numbers (A001263).
- A transform of C(n,2).A082149
A transform of C(n,2).
- A transform of C(n,2).A082150
A transform of C(n,2).
- A transform of C(n,2).A082151
A transform of C(n,2).
- Dispersion of the complement of the pentagonal numbers.A082152
Dispersion of the complement of the pentagonal numbers.
- Dispersion of the complement of row 1 of A082152.A082153
Dispersion of the complement of row 1 of A082152.
- Dispersion of the complement of the hexagonal numbers.A082154
Dispersion of the complement of the hexagonal numbers.
- Dispersion of the complement of row 1 of A082154.A082155
Dispersion of the complement of row 1 of A082154.
- Dispersion of the complement of row 1 of A056536.A082156
Dispersion of the complement of row 1 of A056536.
- Number of deterministic completely defined acyclic automata with 2 inputs and n transient labeled states (and a unique absorbing state).A082157
Number of deterministic completely defined acyclic automata with 2 inputs and n transient labeled states (and a unique absorbing state).
- Number of deterministic completely defined acyclic automata with 3 inputs and n transient labeled states (and a unique absorbing state).A082158
Number of deterministic completely defined acyclic automata with 3 inputs and n transient labeled states (and a unique absorbing state).
- Number of deterministic completely defined acyclic automata with 2 inputs and n+1 transient labeled states including a unique state having all transitions to the absorbing state.A082159
Number of deterministic completely defined acyclic automata with 2 inputs and n+1 transient labeled states including a unique state having all transitions to the absorbing state.
- Deterministic completely defined acyclic automata with 3 inputs and n+1 transient labeled states including a unique state having all transitions to the absorbing state.A082160
Deterministic completely defined acyclic automata with 3 inputs and n+1 transient labeled states including a unique state having all transitions to the absorbing state.