Sequences
392,541 sequences
- a(n) is the exponent of n-th prime in the order (A003131) of the Monster simple group.A051161
a(n) is the exponent of n-th prime in the order (A003131) of the Monster simple group.
- Triangle T(n,k) = n+k, n >= 0, 0 <= k <= n.A051162
Triangle T(n,k) = n+k, n >= 0, 0 <= k <= n.
- Sequence is defined by property that (a0,a1,a2,a3,...) = binomial transform of (a0,a0,a1,a1,a2,a2,a3,a3,...).A051163
Sequence is defined by property that (a0,a1,a2,a3,...) = binomial transform of (a0,a0,a1,a1,a2,a2,a3,a3,...).
- Sequence is defined by property that (a0,a1,a2,a3,...) = binomial transform of (a0,a0,a0,a1,a1,a1,a2,a2,a2,a3,a3,a3,...).A051164
Sequence is defined by property that (a0,a1,a2,a3,...) = binomial transform of (a0,a0,a0,a1,a1,a1,a2,a2,a2,a3,a3,a3,...).
- Sequence is defined by property that binomial transform of (a0,a1,a2,a3,...) = (a0,a0,a1,a1,a2,a2,a3,a3,...).A051165
Sequence is defined by property that binomial transform of (a0,a1,a2,a3,...) = (a0,a0,a1,a1,a2,a2,a3,a3,...).
- Sequence is defined by property that binomial transform of (a0,a1,a2,a3,...) = (a0,a0,a0,a1,a1,a1,a2,a2,a2,a3,a3,a3,...).A051166
Sequence is defined by property that binomial transform of (a0,a1,a2,a3,...) = (a0,a0,a0,a1,a1,a1,a2,a2,a2,a3,a3,a3,...).
- Sum of two positive cubes in at least five ways (all solutions).A051167
Sum of two positive cubes in at least five ways (all solutions).
- Triangular array T(h,k) for 0 <= k <= h read by rows: T(h,k) = number of binary Lyndon words with k ones and h-k zeros.A051168
Triangular array T(h,k) for 0 <= k <= h read by rows: T(h,k) = number of binary Lyndon words with k ones and h-k zeros.
- Smallest number m such that 2*m - p is composite for the first n primes p.A051169
Smallest number m such that 2*m - p is composite for the first n primes p.
- a(n) = T(n,5), array T as in A051168; a count of Lyndon words; aperiodic necklaces with 5 black beads and n-5 white beads.A051170
a(n) = T(n,5), array T as in A051168; a count of Lyndon words; aperiodic necklaces with 5 black beads and n-5 white beads.
- A variation on A056223.A051171
A variation on A056223.
- T(n,7), array T as in A051168; a count of Lyndon words; aperiodic necklaces with 7 black beads and n-7 white beads.A051172
T(n,7), array T as in A051168; a count of Lyndon words; aperiodic necklaces with 7 black beads and n-7 white beads.
- Triangle read by rows: T(n, k) = lcm(n, k).A051173
Triangle read by rows: T(n, k) = lcm(n, k).
- H*-palindromic trees with n nodes.A051174
H*-palindromic trees with n nodes.
- Number of trees T of order n such that W(T) = W(L(L(T))) where W(G) and L(G) are the Wiener index and line graph of a graph G.A051175
Number of trees T of order n such that W(T) = W(L(L(T))) where W(G) and L(G) are the Wiener index and line graph of a graph G.
- If n mod 3 = 0 then n/3 else n.A051176
If n mod 3 = 0 then n/3 else n.
- Perfectly partitioned numbers: numbers k that divide the number of partitions p(k).A051177
Perfectly partitioned numbers: numbers k that divide the number of partitions p(k).
- Numbers k such that k divides the number of divisors of k!.A051178
Numbers k such that k divides the number of divisors of k!.
- a(n) = 2^(2^n) - 1.A051179
a(n) = 2^(2^n) - 1.
- Number of 3-element intersecting families of an n-element set.A051180
Number of 3-element intersecting families of an n-element set.
- Number of 4-element intersecting families of an n-element set.A051181
Number of 4-element intersecting families of an n-element set.
- Number of 5-element intersecting families of an n-element set.A051182
Number of 5-element intersecting families of an n-element set.
- Number of 6-element intersecting families of an n-element set.A051183
Number of 6-element intersecting families of an n-element set.
- Number of 7-element intersecting families of an n-element set.A051184
Number of 7-element intersecting families of an n-element set.
- Number of intersecting families of an n-element set. Also number of n-variable clique Boolean functions.A051185
Number of intersecting families of an n-element set. Also number of n-variable clique Boolean functions.
- Generalized Stirling number triangle of first kind.A051186
Generalized Stirling number triangle of first kind.
- Generalized Stirling number triangle of the first kind.A051187
Generalized Stirling number triangle of the first kind.
- Sept-factorial numbers.A051188
Sept-factorial numbers.
- Octo-factorial numbers.A051189
Octo-factorial numbers.
- a(n) = Product_{k=1..n-1} gcd(k,n).A051190
a(n) = Product_{k=1..n-1} gcd(k,n).
- a(n) = 2^(2^n-2).A051191
a(n) = 2^(2^n-2).
- T(n,7), array T as in A050186; a count of aperiodic binary words.A051192
T(n,7), array T as in A050186; a count of aperiodic binary words.
- a(n) = Sum_{k=1..n} lcm(n,k).A051193
a(n) = Sum_{k=1..n} lcm(n,k).
- Triangular array T read by rows: T(n,k) = number of positive integers that divide both n and k.A051194
Triangular array T read by rows: T(n,k) = number of positive integers that divide both n and k.
- T(2n+2,n), array T as in A050186; a count of aperiodic binary words.A051195
T(2n+2,n), array T as in A050186; a count of aperiodic binary words.
- T(2n+3,n), array T as in A050186; a count of aperiodic binary words.A051196
T(2n+3,n), array T as in A050186; a count of aperiodic binary words.
- T(2n+4,n), array T as in A050186; a count of aperiodic binary words.A051197
T(2n+4,n), array T as in A050186; a count of aperiodic binary words.
- T(2n+5,n), array T as in A050186; a count of aperiodic binary words.A051198
T(2n+5,n), array T as in A050186; a count of aperiodic binary words.
- T(2n+6,n), array T as in A050186; a count of aperiodic binary words.A051199
T(2n+6,n), array T as in A050186; a count of aperiodic binary words.
- Except for initial term, primes of form "n 3's followed by 1".A051200
Except for initial term, primes of form "n 3's followed by 1".
- Sum of elements of the set { [ n/k ] : 1 <= k <= n }.A051201
Sum of elements of the set { [ n/k ] : 1 <= k <= n }.
- Numbers n such that A005210(n) = 0.A051202
Numbers n such that A005210(n) = 0.
- Least inverse of A005210.A051203
Least inverse of A005210.
- Nonnegative numbers of the form x^2-2^y.A051204
Nonnegative numbers of the form x^2-2^y.
- Numbers of the form x^2-3^y >= 0.A051205
Numbers of the form x^2-3^y >= 0.
- Numbers of the form x^2-4^y >= 0.A051206
Numbers of the form x^2-4^y >= 0.
- Numbers of the form x^2-5^y >= 0.A051207
Numbers of the form x^2-5^y >= 0.
- Numbers of the form x^2-6^y >= 0.A051208
Numbers of the form x^2-6^y >= 0.
- Nonnegative numbers of the form x^2-7^y.A051209
Nonnegative numbers of the form x^2-7^y.
- Numbers of the form x^2-8^y >= 0.A051210
Numbers of the form x^2-8^y >= 0.