Sequences
392,541 sequences
- Triangle: Matrix inverse of A047996.A052311
Triangle: Matrix inverse of A047996.
- Column 1 of triangle A052311.A052312
Column 1 of triangle A052311.
- Triangle read by rows: matrix square of A047996.A052313
Triangle read by rows: matrix square of A047996.
- Triangle: Matrix square of A051168.A052314
Triangle: Matrix square of A051168.
- M-type rooted trees on n nodes.A052315
M-type rooted trees on n nodes.
- Number of labeled rooted trees with n nodes and 2-colored internal (non-leaf) nodes.A052316
Number of labeled rooted trees with n nodes and 2-colored internal (non-leaf) nodes.
- Number of labeled trees with n nodes and 2-colored internal (non-leaf) nodes.A052317
Number of labeled trees with n nodes and 2-colored internal (non-leaf) nodes.
- Number of labeled rooted trimmed trees with n nodes.A052318
Number of labeled rooted trimmed trees with n nodes.
- Number of increasing rooted trimmed trees with n nodes.A052319
Number of increasing rooted trimmed trees with n nodes.
- Number of labeled trimmed trees with n nodes.A052320
Number of labeled trimmed trees with n nodes.
- Number of rooted trees with a forbidden limb of length 3.A052321
Number of rooted trees with a forbidden limb of length 3.
- Number of labeled rooted trees with a forbidden limb of length 3.A052322
Number of labeled rooted trees with a forbidden limb of length 3.
- Number of labeled trees with a forbidden limb of length 3.A052323
Number of labeled trees with a forbidden limb of length 3.
- Number of increasing rooted trees with a forbidden limb of length 3.A052324
Number of increasing rooted trees with a forbidden limb of length 3.
- Number of asymmetric rooted trees with a forbidden limb of length 3.A052325
Number of asymmetric rooted trees with a forbidden limb of length 3.
- Number of asymmetric trees with a forbidden limb of length 3.A052326
Number of asymmetric trees with a forbidden limb of length 3.
- Number of rooted trees with a forbidden limb of length 4.A052327
Number of rooted trees with a forbidden limb of length 4.
- Number of rooted trees with a forbidden limb of length 5.A052328
Number of rooted trees with a forbidden limb of length 5.
- Number of rooted trees with a forbidden limb of length 6.A052329
Number of rooted trees with a forbidden limb of length 6.
- Let S_k denote the first 2^k terms of this sequence and let b_k be the smallest positive integer that is not in S_k; then the numbers b_k*S_k are the next 2^k terms.A052330
Let S_k denote the first 2^k terms of this sequence and let b_k be the smallest positive integer that is not in S_k; then the numbers b_k*S_k are the next 2^k terms.
- Inverse of A052330; A binary encoding of Fermi-Dirac factorization of n, shown in decimal.A052331
Inverse of A052330; A binary encoding of Fermi-Dirac factorization of n, shown in decimal.
- Number of labeled digraphs where every node has indegree 0 or outdegree 0 and no isolated nodes.A052332
Number of labeled digraphs where every node has indegree 0 or outdegree 0 and no isolated nodes.
- Riesel problem: start with n; repeatedly double and add 1 until reach a prime. Sequence gives a(n) = prime reached, or 0 if no prime is ever reached.A052333
Riesel problem: start with n; repeatedly double and add 1 until reach a prime. Sequence gives a(n) = prime reached, or 0 if no prime is ever reached.
- Record primes reached in A052333.A052334
Record primes reached in A052333.
- Number of partitions of n into at most 1 copy of 1, 2 copies of 2, 3 copies of 3, ... .A052335
Number of partitions of n into at most 1 copy of 1, 2 copies of 2, 3 copies of 3, ... .
- Shifts left under transform in formula line.A052336
Shifts left under transform in formula line.
- Number of partitions into at most a(1) copies of 1, a(2) copies of 2, ...A052337
Number of partitions into at most a(1) copies of 1, a(2) copies of 2, ...
- a(n) = A050443(n-th prime)/(n-th prime).A052338
a(n) = A050443(n-th prime)/(n-th prime).
- Values of n at which record values in A052340 are reached.A052339
Values of n at which record values in A052340 are reached.
- Record numbers of iterations reached in A050412.A052340
Record numbers of iterations reached in A050412.
- Shifts left two places under BIN1 transform.A052341
Shifts left two places under BIN1 transform.
- Shifts left under Stirling-Bernoulli transform.A052342
Shifts left under Stirling-Bernoulli transform.
- Number of ways to write n as the unordered sum of two triangular numbers (zero allowed).A052343
Number of ways to write n as the unordered sum of two triangular numbers (zero allowed).
- Number of ways to write n as the unordered sum of two nonzero triangular numbers.A052344
Number of ways to write n as the unordered sum of two nonzero triangular numbers.
- Least k such that A052343(k)=n.A052345
Least k such that A052343(k)=n.
- Smallest number which is the sum of two positive triangular numbers in exactly n different ways.A052346
Smallest number which is the sum of two positive triangular numbers in exactly n different ways.
- Record values reached in A052343 and A052344.A052347
Record values reached in A052343 and A052344.
- Indices of A052343 (ways to write n as sum of two triangular numbers) where record values are reached.A052348
Indices of A052343 (ways to write n as sum of two triangular numbers) where record values are reached.
- Lexicographically earliest sequence of distinct positive integers such that no subsequence sums to a prime.A052349
Lexicographically earliest sequence of distinct positive integers such that no subsequence sums to a prime.
- Least prime in A001359 (lesser of twin primes) such that the distance (A053319) to the next twin is 6*n.A052350
Least prime in A001359 (lesser of twin primes) such that the distance (A053319) to the next twin is 6*n.
- Least prime in A023200 (lesser of 4-twins) such that the distance to the next 4-twin is 6*n.A052351
Least prime in A023200 (lesser of 4-twins) such that the distance to the next 4-twin is 6*n.
- Least prime in A031924 (lesser of 6-twins) such that the distance to the next 6-twin is 2*n.A052352
Least prime in A031924 (lesser of 6-twins) such that the distance to the next 6-twin is 2*n.
- Least prime in A031926 (lesser of 8-twins) whose distance to the next 8-twin is 6*n.A052353
Least prime in A031926 (lesser of 8-twins) whose distance to the next 8-twin is 6*n.
- Least prime in A031928 (lesser of 10-twins) whose distance to the next 10-twin is 6*n.A052354
Least prime in A031928 (lesser of 10-twins) whose distance to the next 10-twin is 6*n.
- Least prime in A031930 (lesser of 12-twins) whose distance to the next 12-twin is 2*n.A052355
Least prime in A031930 (lesser of 12-twins) whose distance to the next 12-twin is 2*n.
- Least prime in A031932 (lesser of 14-twins) whose distance to the next 14-twin is 6*n.A052356
Least prime in A031932 (lesser of 14-twins) whose distance to the next 14-twin is 6*n.
- Least prime in A031934 (lesser of 16-twins) whose distance to the next 16-twin is 6*n.A052357
Least prime in A031934 (lesser of 16-twins) whose distance to the next 16-twin is 6*n.
- Least prime in A031936 (lesser of 18-twins) whose distance to the next 18-twin is 2*n.A052358
Least prime in A031936 (lesser of 18-twins) whose distance to the next 18-twin is 2*n.
- Least prime in A031938 (lesser of primes differing by 20) whose distance to the next 20-twin is 6*n.A052359
Least prime in A031938 (lesser of primes differing by 20) whose distance to the next 20-twin is 6*n.
- Number of characters in the English name of n, including spaces and hyphens.A052360
Number of characters in the English name of n, including spaces and hyphens.