Sequences
392,541 sequences
- Continued fraction expansion of -x, the largest negative root of the equation Fibonacci(x) = 0.A089261
Continued fraction expansion of -x, the largest negative root of the equation Fibonacci(x) = 0.
- a(n) = 2^floor(log_2(n)) - 2^floor(log_2(n*2/3)).A089262
a(n) = 2^floor(log_2(n)) - 2^floor(log_2(n*2/3)).
- First differences of A080791.A089263
First differences of A080791.
- Number of permutations of length n containing exactly once 132 and 213, likewise for pattern pair (231,312).A089264
Number of permutations of length n containing exactly once 132 and 213, likewise for pattern pair (231,312).
- a(1) = 0; thereafter a(2*n) = a(n) + 1, a(2*n+1) = 2*n.A089265
a(1) = 0; thereafter a(2*n) = a(n) + 1, a(2*n+1) = 2*n.
- Rational knots of determinant 2n+1, counting chiral pairs twice.A089266
Rational knots of determinant 2n+1, counting chiral pairs twice.
- Continued fraction expansion with iterated 3-fold symmetry.A089267
Continued fraction expansion with iterated 3-fold symmetry.
- Odd semiprimes m such that m-2 is composite.A089268
Odd semiprimes m such that m-2 is composite.
- Squarefree numbers congruent to 1 or 2 mod 4.A089269
Squarefree numbers congruent to 1 or 2 mod 4.
- Positive numbers represented by the integer binary quadratic form x^2 + x*y - y^2 with x and y relatively prime.A089270
Positive numbers represented by the integer binary quadratic form x^2 + x*y - y^2 with x and y relatively prime.
- Third column (k=4) of array A078739(n,k) ((2,2)-generalized Stirling2).A089271
Third column (k=4) of array A078739(n,k) ((2,2)-generalized Stirling2).
- Fourth column (k=5) of array A078739(n,k) ((2,2)- generalized Stirling2) divided by 12.A089272
Fourth column (k=5) of array A078739(n,k) ((2,2)- generalized Stirling2) divided by 12.
- Fifth column (k=6) of array A078739(n,k) ((2,2)-generalized Stirling2).A089273
Fifth column (k=6) of array A078739(n,k) ((2,2)-generalized Stirling2).
- Fifth column of the Legendre-Stirling triangle A071951.A089274
Fifth column of the Legendre-Stirling triangle A071951.
- Coefficient triangle of polynomials used for numerator of g.f.s for column sequences of array A078739.A089275
Coefficient triangle of polynomials used for numerator of g.f.s for column sequences of array A078739.
- Coefficient triangle of polynomials used for numerator of g.f.s for column sequences of array A078739.A089276
Coefficient triangle of polynomials used for numerator of g.f.s for column sequences of array A078739.
- Sixth column of the triangle A071951 (Legendre-Stirling).A089277
Sixth column of the triangle A071951 (Legendre-Stirling).
- Coefficient triangle for computation of column numbers of triangle A071951 (Legendre-Stirling).A089278
Coefficient triangle for computation of column numbers of triangle A071951 (Legendre-Stirling).
- a(n) = 2 + sum(k=1 to n) [(-1)^k A001511(k)].A089279
a(n) = 2 + sum(k=1 to n) [(-1)^k A001511(k)].
- Tower of Hanoi game: a(n) is the number of pegs occupied by already-moved disks after move #n.A089280
Tower of Hanoi game: a(n) is the number of pegs occupied by already-moved disks after move #n.
- Smallest prime factor of floor(Pi*10^n).A089281
Smallest prime factor of floor(Pi*10^n).
- Number of distinct prime factors of floor(Pi*10^n), Pi=3.14...A089282
Number of distinct prime factors of floor(Pi*10^n), Pi=3.14...
- Total number of prime factors of floor(Pi*10^n), Pi=3.14...A089283
Total number of prime factors of floor(Pi*10^n), Pi=3.14...
- Number of divisors of floor(Pi*10^n), Pi=3.14...A089284
Number of divisors of floor(Pi*10^n), Pi=3.14...
- Sum of divisors of floor(Pi*10^n), Pi=3.14...A089285
Sum of divisors of floor(Pi*10^n), Pi=3.14...
- Sum of distinct prime factors of floor(Pi*10^n), Pi=3.14....A089286
Sum of distinct prime factors of floor(Pi*10^n), Pi=3.14....
- Sum of all prime factors of floor(Pi*10^n), Pi=3.14....A089287
Sum of all prime factors of floor(Pi*10^n), Pi=3.14....
- Euler's totient of floor(Pi*10^n), Pi=3.14....A089288
Euler's totient of floor(Pi*10^n), Pi=3.14....
- Squarefree kernel of floor(Pi*10^n), Pi = 3.14....A089289
Squarefree kernel of floor(Pi*10^n), Pi = 3.14....
- Digital root of floor(Pi*10^n), Pi=3.14....A089290
Digital root of floor(Pi*10^n), Pi=3.14....
- Prime worms (as defined below).A089291
Prime worms (as defined below).
- G.f.: Product_{m>=1} 1/(1-x^m)^A018819(m).A089292
G.f.: Product_{m>=1} 1/(1-x^m)^A018819(m).
- Sum of digits in the mixed-base enumeration system n=...d(4)d(3)d(2)d(1), where the digits satisfy 0<=d(i)<=1 if i is odd, 0<=d(i)<=2 if i is even.A089293
Sum of digits in the mixed-base enumeration system n=...d(4)d(3)d(2)d(1), where the digits satisfy 0<=d(i)<=1 if i is odd, 0<=d(i)<=2 if i is even.
- Smallest prime p_k such that n can be written as a "plus-minus" sum n=sum_(i=1..k)e_i*(p_i)^2 with distinct primes p_i<=p_k, where e_i is 1 or -1.A089294
Smallest prime p_k such that n can be written as a "plus-minus" sum n=sum_(i=1..k)e_i*(p_i)^2 with distinct primes p_i<=p_k, where e_i is 1 or -1.
- Positions of the records in A089294. First integer requiring a larger prime in its representation by (signed) sums of squares of distinct primes than all preceding integers.A089295
Positions of the records in A089294. First integer requiring a larger prime in its representation by (signed) sums of squares of distinct primes than all preceding integers.
- Maximum prime required in the representation of the square of the n-th prime A000040(n) by a signed sum of squares of distinct other primes minimizing the largest prime used in the sum.A089296
Maximum prime required in the representation of the square of the n-th prime A000040(n) by a signed sum of squares of distinct other primes minimizing the largest prime used in the sum.
- Maximum prime required in the representation of the square of the n-th prime A000040(n) by a signed sum of squares of distinct other primes minimizing the number of terms in the sum.A089297
Maximum prime required in the representation of the square of the n-th prime A000040(n) by a signed sum of squares of distinct other primes minimizing the number of terms in the sum.
- Smallest prime with digit product 10^n.A089298
Smallest prime with digit product 10^n.
- Number of square plane partitions of n.A089299
Number of square plane partitions of n.
- Number of planar partitions of n (A000219) that are non-squashing along rows and down columns (cf. A018819).A089300
Number of planar partitions of n (A000219) that are non-squashing along rows and down columns (cf. A018819).
- Number of C-types (or contiguity types) of n-dimensional lattices.A089301
Number of C-types (or contiguity types) of n-dimensional lattices.
- Triangle read by rows in which each row is the inverse binomial transform of a diagonal of A089246.A089302
Triangle read by rows in which each row is the inverse binomial transform of a diagonal of A089246.
- a(n) = floor( (10^n - 1) / (9*n) ).A089303
a(n) = floor( (10^n - 1) / (9*n) ).
- Sum of all digits in all even numbers from 0 to 222...2 (with n 2's).A089304
Sum of all digits in all even numbers from 0 to 222...2 (with n 2's).
- Smallest prime of the form n*(n+1)*(n+2)...(n+k) + 1, k > 0, i.e., a(n) > n+1, or 0 if no such prime exists.A089305
Smallest prime of the form n*(n+1)*(n+2)...(n+k) + 1, k > 0, i.e., a(n) > n+1, or 0 if no such prime exists.
- Smallest prime of the form n + (n+1)+ (n+2)+...+(n+k), or 0 if no such prime exists.A089306
Smallest prime of the form n + (n+1)+ (n+2)+...+(n+k), or 0 if no such prime exists.
- Smallest prime of the form 1+n*(n+n_2)*...*(n+n_n) with 1<=n_2<n_3<...<n_n. A089308 gives terms of products.A089307
Smallest prime of the form 1+n*(n+n_2)*...*(n+n_n) with 1<=n_2<n_3<...<n_n. A089308 gives terms of products.
- Triangle read by rows, in which n-th row contains n numbers starting with n and in increasing order such that the product of the terms + 1 gives the smallest such prime.A089308
Triangle read by rows, in which n-th row contains n numbers starting with n and in increasing order such that the product of the terms + 1 gives the smallest such prime.
- Write n in binary; a(n) = length of the rightmost run of 1's.A089309
Write n in binary; a(n) = length of the rightmost run of 1's.
- Write n in binary; a(n) = number of 1's in second block of 1's from right.A089310
Write n in binary; a(n) = number of 1's in second block of 1's from right.