Sequences
392,541 sequences
- Expansion of x/(x^4-3*x^3+4*x^2-2*x+1).A051111
Expansion of x/(x^4-3*x^3+4*x^2-2*x+1).
- Number of monotone Boolean functions of n variables with 4 mincuts. Also Sperner systems with 4 blocks.A051112
Number of monotone Boolean functions of n variables with 4 mincuts. Also Sperner systems with 4 blocks.
- Number of monotone Boolean functions of n variables with 5 mincuts.A051113
Number of monotone Boolean functions of n variables with 5 mincuts.
- Number of monotone Boolean functions of n variables with 6 mincuts.A051114
Number of monotone Boolean functions of n variables with 6 mincuts.
- Number of monotone Boolean functions of n variables with 7 mincuts.A051115
Number of monotone Boolean functions of n variables with 7 mincuts.
- Number of monotone Boolean functions of n variables with 8 mincuts.A051116
Number of monotone Boolean functions of n variables with 8 mincuts.
- Number of monotone Boolean functions of n variables with 9 mincuts.A051117
Number of monotone Boolean functions of n variables with 9 mincuts.
- Number of monotone Boolean functions of n variables with 10 mincuts.A051118
Number of monotone Boolean functions of n variables with 10 mincuts.
- a(n) = n/p^k, where p = largest prime dividing n and p^k = highest power of p dividing n.A051119
a(n) = n/p^k, where p = largest prime dividing n and p^k = highest power of p dividing n.
- Start with 1; at n-th step, write down what is in the sequence so far.A051120
Start with 1; at n-th step, write down what is in the sequence so far.
- Dates at fortnightly intervals starting on Jan 01 of a leap year in the Julian calendar.A051121
Dates at fortnightly intervals starting on Jan 01 of a leap year in the Julian calendar.
- a(n) = Fibonacci(n) AND Fibonacci(n+1).A051122
a(n) = Fibonacci(n) AND Fibonacci(n+1).
- a(n) = Fibonacci(n) OR Fibonacci(n+1).A051123
a(n) = Fibonacci(n) OR Fibonacci(n+1).
- a(n) = Fibonacci(n) XOR Fibonacci(n+1).A051124
a(n) = Fibonacci(n) XOR Fibonacci(n+1).
- Table T(n,k) = max{n,k} read by antidiagonals (n >= 1, k >= 1).A051125
Table T(n,k) = max{n,k} read by antidiagonals (n >= 1, k >= 1).
- Table T(n,k) = n mod k read by downward antidiagonals (n >= 1, k >= 1).A051126
Table T(n,k) = n mod k read by downward antidiagonals (n >= 1, k >= 1).
- Table T(n,k) = k mod n read by antidiagonals (n >= 1, k >= 1).A051127
Table T(n,k) = k mod n read by antidiagonals (n >= 1, k >= 1).
- Table T(n,k) = n^k read by upwards antidiagonals (n >= 1, k >= 1).A051128
Table T(n,k) = n^k read by upwards antidiagonals (n >= 1, k >= 1).
- Table T(n,k) = k^n read by upwards antidiagonals (n >= 1, k >= 1).A051129
Table T(n,k) = k^n read by upwards antidiagonals (n >= 1, k >= 1).
- Indices of prime Bell numbers A000110.A051130
Indices of prime Bell numbers A000110.
- Prime Bell numbers (A000110).A051131
Prime Bell numbers (A000110).
- Number of ordered pairs of integers (x,y) with x^2+y^2 < n^2.A051132
Number of ordered pairs of integers (x,y) with x^2+y^2 < n^2.
- a(n) = binomial(2n,n)*n*(2n+1)/2.A051133
a(n) = binomial(2n,n)*n*(2n+1)/2.
- (Terms in A050825)/2.A051134
(Terms in A050825)/2.
- a(n) = number of times n appears in the Hofstadter-Conway $10000 sequence A004001.A051135
a(n) = number of times n appears in the Hofstadter-Conway $10000 sequence A004001.
- Number of 2-colored generalized Frobenius partitions.A051136
Number of 2-colored generalized Frobenius partitions.
- Table T(n,k) read by antidiagonals: number of necklaces allowing turnovers (bracelets) with n beads of k colors.A051137
Table T(n,k) read by antidiagonals: number of necklaces allowing turnovers (bracelets) with n beads of k colors.
- Divisibility sequence associated with elliptic curve y^2 + y = x^3 - x and point (1, 0).A051138
Divisibility sequence associated with elliptic curve y^2 + y = x^3 - x and point (1, 0).
- a(n) = A000994(n+2) - A000995(n+2).A051139
a(n) = A000994(n+2) - A000995(n+2).
- a(n) = (A000110(n) - A000994(n+2))/2.A051140
a(n) = (A000110(n) - A000994(n+2))/2.
- Triangle read by rows: a(n, m) = S1(n, m)*3^(n-m), where S1 are the signed Stirling numbers of first kind A008275 (n >= 1, 1 <= m <= n).A051141
Triangle read by rows: a(n, m) = S1(n, m)*3^(n-m), where S1 are the signed Stirling numbers of first kind A008275 (n >= 1, 1 <= m <= n).
- Generalized Stirling number triangle of first kind.A051142
Generalized Stirling number triangle of first kind.
- Numbers k such that the k-th prime is a partition number.A051143
Numbers k such that the k-th prime is a partition number.
- Nonsquarefree nonsquares: each term has a square factor but is not a perfect square itself.A051144
Nonsquarefree nonsquares: each term has a square factor but is not a perfect square itself.
- a(0)=0, a(1)=1, a(n) = smallest number such that sequence b(n) = a(n) OR a(n+1) is strictly monotonically increasing.A051145
a(0)=0, a(1)=1, a(n) = smallest number such that sequence b(n) = a(n) OR a(n+1) is strictly monotonically increasing.
- Sequence b(n) mentioned in A051145.A051146
Sequence b(n) mentioned in A051145.
- Smallest m such that A051145(m) = 2^n.A051147
Smallest m such that A051145(m) = 2^n.
- Decimal expansion of BesselK(1,2)/BesselK(0,2).A051148
Decimal expansion of BesselK(1,2)/BesselK(0,2).
- Continued fraction for BesselK(1,2)/BesselK(0,2).A051149
Continued fraction for BesselK(1,2)/BesselK(0,2).
- Generalized Stirling number triangle of first kind.A051150
Generalized Stirling number triangle of first kind.
- Generalized Stirling number triangle of first kind.A051151
Generalized Stirling number triangle of first kind.
- (-1)sigma sociable number of order 2: (-1)sigma((-1)sigma(x))=x, but (-1)sigma(x)<>x, where if x=Product p(i)^r(i) then (-1)sigma(x)=Product (-1+Sum p(i)^s(i), s(i)=1 to r(i)); (-1)sigma(1)=1.A051152
(-1)sigma sociable number of order 2: (-1)sigma((-1)sigma(x))=x, but (-1)sigma(x)<>x, where if x=Product p(i)^r(i) then (-1)sigma(x)=Product (-1+Sum p(i)^s(i), s(i)=1 to r(i)); (-1)sigma(1)=1.
- (-1)-sigma super perfect numbers: (-1)sigma((-1)sigma(x))=2*x, where if x=Product p(i)^r(i) then (-1)sigma(x)=Product (-1+Sum p(i)^s(i), s(i)=1 to r(i)); (-1)sigma(1)=1.A051153
(-1)-sigma super perfect numbers: (-1)sigma((-1)sigma(x))=2*x, where if x=Product p(i)^r(i) then (-1)sigma(x)=Product (-1+Sum p(i)^s(i), s(i)=1 to r(i)); (-1)sigma(1)=1.
- a(n) = 1 + 2^k + 4^k where k = 3^n.A051154
a(n) = 1 + 2^k + 4^k where k = 3^n.
- a(n) = (2^5^(n+1) - 1)/(2^5^n - 1).A051155
a(n) = (2^5^(n+1) - 1)/(2^5^n - 1).
- a(n) = (2^p^2 - 1)/(2^p - 1) where p is the n-th prime.A051156
a(n) = (2^p^2 - 1)/(2^p - 1) where p is the n-th prime.
- a(n) = (2^p^3 - 1)/(2^p^2 - 1) where p = n-th prime.A051157
a(n) = (2^p^3 - 1)/(2^p^2 - 1) where p = n-th prime.
- Decimal expansion of Sum_{n >= 0} 1/(2^2^n+1).A051158
Decimal expansion of Sum_{n >= 0} 1/(2^2^n+1).
- Triangle read by rows: T(n, k) = binomial(n mod 2, k mod 2) * binomial(n div 2, k div 2), where 'div' denotes integer division.A051159
Triangle read by rows: T(n, k) = binomial(n mod 2, k mod 2) * binomial(n div 2, k div 2), where 'div' denotes integer division.
- Coefficients in expansion of (1-x)^floor(n/2)(1+x)^ceiling(n/2).A051160
Coefficients in expansion of (1-x)^floor(n/2)(1+x)^ceiling(n/2).