Sequences
392,541 sequences
- A023219 indexed by A000040.A090161
A023219 indexed by A000040.
- Values of binomial(Fibonacci(2k)*Fibonacci(2k+1),Fibonacci(2k-1)*Fibonacci(2k)-1).A090162
Values of binomial(Fibonacci(2k)*Fibonacci(2k+1),Fibonacci(2k-1)*Fibonacci(2k)-1).
- Triangle T(j,k) read by rows, where T(j,K)=number of different configurations having the largest required number of moves S(j,k)=A090033(n) in optimal solutions of the j X k generalization of Sam Loyd's sliding block 15-puzzle, starting with the empty square in a corner.A090163
Triangle T(j,k) read by rows, where T(j,K)=number of different configurations having the largest required number of moves S(j,k)=A090033(n) in optimal solutions of the j X k generalization of Sam Loyd's sliding block 15-puzzle, starting with the empty square in a corner.
- Number of configurations of Sam Loyd's sliding block 15-puzzle that require a minimum of n moves to be reached, starting with the empty square at one of the 4 central squares.A090164
Number of configurations of Sam Loyd's sliding block 15-puzzle that require a minimum of n moves to be reached, starting with the empty square at one of the 4 central squares.
- Number of configurations of Sam Loyd's sliding block 15-puzzle that require a minimum of n moves to be reached, starting with the empty square at one of the 8 non-corner boundary squares.A090165
Number of configurations of Sam Loyd's sliding block 15-puzzle that require a minimum of n moves to be reached, starting with the empty square at one of the 8 non-corner boundary squares.
- Number of configurations of the 4 X 3 variant of Sam Loyd's sliding block 15-puzzle that require a minimum of n moves to be reached, starting with the empty square in one of the corners.A090166
Number of configurations of the 4 X 3 variant of Sam Loyd's sliding block 15-puzzle that require a minimum of n moves to be reached, starting with the empty square in one of the corners.
- Number of configurations of the 6 X 2 variant of the so-called "Sam Loyd" sliding block 15-puzzle that require a minimum of n moves to be reached, starting with the empty square in one of the corners.A090167
Number of configurations of the 6 X 2 variant of the so-called "Sam Loyd" sliding block 15-puzzle that require a minimum of n moves to be reached, starting with the empty square in one of the corners.
- Floor( 3n/2 ) - floor( 2n/3 ).A090168
Floor( 3n/2 ) - floor( 2n/3 ).
- a(n) = floor( 3*n/2 ) + floor( 2*n/3 ).A090169
a(n) = floor( 3*n/2 ) + floor( 2*n/3 ).
- a(n) = floor(e^(n*g)), where g = Euler's Gamma constant, 0.57721566490153...A090170
a(n) = floor(e^(n*g)), where g = Euler's Gamma constant, 0.57721566490153...
- Triangle read by rows, related to Pascal's triangle read mod 2, starting with 0, 1, 0.A090171
Triangle read by rows, related to Pascal's triangle read mod 2, starting with 0, 1, 0.
- Triangle read by rows, related to Pascal's triangle read mod 2.A090172
Triangle read by rows, related to Pascal's triangle read mod 2.
- Triangle read by rows, related to Pascal's triangle read mod 2, starting with 0, 0, 1.A090173
Triangle read by rows, related to Pascal's triangle read mod 2, starting with 0, 0, 1.
- Triangle read by rows, related to Pascal's triangle read mod 2.A090174
Triangle read by rows, related to Pascal's triangle read mod 2.
- a(n) = Mod[n,10+Sum[Mod[Floor[n/10^m],10],{m,1,10}]].A090175
a(n) = Mod[n,10+Sum[Mod[Floor[n/10^m],10],{m,1,10}]].
- G.f.: (1+x^9)/((1-x^4)(1-x^6)(1-x^12)).A090176
G.f.: (1+x^9)/((1-x^4)(1-x^6)(1-x^12)).
- Numbers n such that numerator(Bernoulli(2*n)/(2*n)) is different from numerator(Bernoulli(2*n)/(2*n*(2*n+1))).A090177
Numbers n such that numerator(Bernoulli(2*n)/(2*n)) is different from numerator(Bernoulli(2*n)/(2*n*(2*n+1))).
- a(1) = 2; for n > 1, a(n) = n + prime(n-1).A090178
a(1) = 2; for n > 1, a(n) = n + prime(n-1).
- Ratio of numerator(Bernoulli(2*n)/(2*n)) to numerator(Bernoulli(2*n)/(2*n*(2*n+1))) for n's for which they are different.A090179
Ratio of numerator(Bernoulli(2*n)/(2*n)) to numerator(Bernoulli(2*n)/(2*n*(2*n+1))) for n's for which they are different.
- Primes p = prime(n) such that p + sum-of-digits(p) +- 1 = prime(n+1).A090180
Primes p = prime(n) such that p + sum-of-digits(p) +- 1 = prime(n+1).
- Triangle of Narayana (A001263) with 0 <= k <= n, read by rows.A090181
Triangle of Narayana (A001263) with 0 <= k <= n, read by rows.
- Triangle T(n,k), 0 <= k <= n, composed of k-Catalan numbers.A090182
Triangle T(n,k), 0 <= k <= n, composed of k-Catalan numbers.
- a(n) = (10 - (prime(n+3) mod 10) mod 4) - (n mod 4) + 3.A090183
a(n) = (10 - (prime(n+3) mod 10) mod 4) - (n mod 4) + 3.
- Number of partitions of the n-th 3-smooth number into parts 2 and 3.A090184
Number of partitions of the n-th 3-smooth number into parts 2 and 3.
- Least k such that k*p(n)# + p(n+1) is prime, where p(i)# denotes i-th primorial and p(i) denotes i-th prime.A090185
Least k such that k*p(n)# + p(n+1) is prime, where p(i)# denotes i-th primorial and p(i) denotes i-th prime.
- a(n) is the least prime of the form prime(n)# * k + prime(n+1).A090186
a(n) is the least prime of the form prime(n)# * k + prime(n+1).
- Primes of the form 11*n+2.A090187
Primes of the form 11*n+2.
- Primes P such that P=k*p(n)#-p(n+1) is prime for least k. Here p(i)# denotes the i-th primorial and p(i) denotes the i-th prime.A090188
Primes P such that P=k*p(n)#-p(n+1) is prime for least k. Here p(i)# denotes the i-th primorial and p(i) denotes the i-th prime.
- Least k such that k*p(n)#-p(n+1) is prime, where p(i)# denotes the i-th primorial and p(i) denotes the i-th prime.A090189
Least k such that k*p(n)#-p(n+1) is prime, where p(i)# denotes the i-th primorial and p(i) denotes the i-th prime.
- Symmetric primes: an odd prime p is symmetric if there exists an odd prime q such that |p-q| = gcd(p-1,q-1).A090190
Symmetric primes: an odd prime p is symmetric if there exists an odd prime q such that |p-q| = gcd(p-1,q-1).
- Asymmetric primes: an odd prime p is asymmetric if there is no odd prime q such that |p-q|=gcd(p-1,q-1).A090191
Asymmetric primes: an odd prime p is asymmetric if there is no odd prime q such that |p-q|=gcd(p-1,q-1).
- Carlitz-Riordan q-Catalan numbers (recurrence version) for q = -1.A090192
Carlitz-Riordan q-Catalan numbers (recurrence version) for q = -1.
- a(n) = A053838(n) + 1 modulo 3.A090193
a(n) = A053838(n) + 1 modulo 3.
- Primes which when multiplied by their largest digit and 1 is added form another prime.A090194
Primes which when multiplied by their largest digit and 1 is added form another prime.
- Primes which when multiplied by their largest digit and 1 is subtracted form another prime.A090195
Primes which when multiplied by their largest digit and 1 is subtracted form another prime.
- Odd integers with two divisors a, b such that a < b <= 2a.A090196
Odd integers with two divisors a, b such that a < b <= 2a.
- a(n) = n^3 + 6*n^2 + 6*n + 1.A090197
a(n) = n^3 + 6*n^2 + 6*n + 1.
- a(n) = N(5,n), where N(5,x) is the 5th Narayana polynomial.A090198
a(n) = N(5,n), where N(5,x) is the 5th Narayana polynomial.
- a(n) = N(6,n), where N(6,x) is the 6th Narayana polynomial.A090199
a(n) = N(6,n), where N(6,x) is the 6th Narayana polynomial.
- a(n) = N(7,n), where N(7,x) is the 7th Narayana polynomial.A090200
a(n) = N(7,n), where N(7,x) is the 7th Narayana polynomial.
- a(n) = p-th digit of Pi where p = n-th prime.A090201
a(n) = p-th digit of Pi where p = n-th prime.
- a(n) = p-th digit of e where p = n-th prime.A090202
a(n) = p-th digit of e where p = n-th prime.
- a(n) = p-th digit of phi where p = n-th prime.A090203
a(n) = p-th digit of phi where p = n-th prime.
- a(n) = p-th digit of sqrt(2) where p = n-th prime.A090204
a(n) = p-th digit of sqrt(2) where p = n-th prime.
- a(n) = n^n * (n+1)^(n+1).A090205
a(n) = n^n * (n+1)^(n+1).
- Nonprime Fibonacci numbers.A090206
Nonprime Fibonacci numbers.
- Number of factors of n-th nonprime Fibonacci number.A090207
Number of factors of n-th nonprime Fibonacci number.
- Sums of two consecutive nonprime Fibonacci numbers (A090206).A090208
Sums of two consecutive nonprime Fibonacci numbers (A090206).
- Generalized Bell numbers (from (5,5)-Stirling2 array A090216).A090209
Generalized Bell numbers (from (5,5)-Stirling2 array A090216).
- Triangle of certain generalized Bell numbers.A090210
Triangle of certain generalized Bell numbers.