Sequences
392,541 sequences
- Concatenation of two distinct primes p and q, p < q.A090311
Concatenation of two distinct primes p and q, p < q.
- Primes in A090311.A090312
Primes in A090311.
- a(n) = 22*a(n-1) + a(n-2), starting with a(0) = 2 and a(1) = 22.A090313
a(n) = 22*a(n-1) + a(n-2), starting with a(0) = 2 and a(1) = 22.
- a(n) = 23*a(n-1) + a(n-2), starting with a(0) = 2 and a(1) = 23.A090314
a(n) = 23*a(n-1) + a(n-2), starting with a(0) = 2 and a(1) = 23.
- Least k such that k and digit reversal of k both have n divisors, or 0 if no such number exists.A090315
Least k such that k and digit reversal of k both have n divisors, or 0 if no such number exists.
- a(n) = 24*a(n-1) + a(n-2), starting with a(0) = 2 and a(1) = 24.A090316
a(n) = 24*a(n-1) + a(n-2), starting with a(0) = 2 and a(1) = 24.
- Row sums of triangle in A090285.A090317
Row sums of triangle in A090285.
- a(n) = least positive k such that k, k+1, k+2, ..., k+n-1 is a stapled interval of length n, or 0 if no such sequence exists.A090318
a(n) = least positive k such that k, k+1, k+2, ..., k+n-1 is a stapled interval of length n, or 0 if no such sequence exists.
- Fifth column (k=4) of triangle A084938.A090319
Fifth column (k=4) of triangle A084938.
- Duplicate of A085909.A090320
Duplicate of A085909.
- T(n,k) = prime(n+1) - prime(n-k+1), 1<=k<=n, triangular array read by rows.A090321
T(n,k) = prime(n+1) - prime(n-k+1), 1<=k<=n, triangular array read by rows.
- Duplicate of A076084.A090322
Duplicate of A076084.
- Literal string created by the first time an orderless exponent appears; the exponents from A025487.A090323
Literal string created by the first time an orderless exponent appears; the exponents from A025487.
- Second in a series of triangular arrays generating the natural numbers (cf. A079946).A090324
Second in a series of triangular arrays generating the natural numbers (cf. A079946).
- Least (distinct) k such that k, k+n, k+2n are all composite. Rearrangement of composite numbers.A090325
Least (distinct) k such that k, k+n, k+2n are all composite. Rearrangement of composite numbers.
- Number of rules of a context-free grammar in Chomsky normal form that generates all permutations of n symbols.A090326
Number of rules of a context-free grammar in Chomsky normal form that generates all permutations of n symbols.
- Number of rules of a context-free grammar in Chomsky normal form that generates all permutations of n symbols.A090327
Number of rules of a context-free grammar in Chomsky normal form that generates all permutations of n symbols.
- Number of rules of a context-free grammar in Chomsky normal form that generates all permutations of n symbols.A090328
Number of rules of a context-free grammar in Chomsky normal form that generates all permutations of n symbols.
- Number of divisors of n that are prefixes of other divisors of n in binary representation.A090329
Number of divisors of n that are prefixes of other divisors of n in binary representation.
- Number of divisors >1 of n that are prefixes of other divisors of n in binary representation.A090330
Number of divisors >1 of n that are prefixes of other divisors of n in binary representation.
- Largest proper divisor of n that is also a prefix of n in binary.A090331
Largest proper divisor of n that is also a prefix of n in binary.
- Numbers with no divisors >1 that are prefixes of other divisors in binary representation.A090332
Numbers with no divisors >1 that are prefixes of other divisors in binary representation.
- Nonprimes with no divisors >1 that are prefixes of other divisors in binary representation.A090333
Nonprimes with no divisors >1 that are prefixes of other divisors in binary representation.
- Numbers with at least one divisor >1 that is a prefix of another divisor in binary representation.A090334
Numbers with at least one divisor >1 that is a prefix of another divisor in binary representation.
- Smallest number with exactly n distinct prime factors such that in binary representation the divisors >1 form a prefix code.A090335
Smallest number with exactly n distinct prime factors such that in binary representation the divisors >1 form a prefix code.
- Odd-indexed terms of the first binomial transform equals 1 and the even-indexed terms of the third binomial transform equals 1, with a(0)=1.A090336
Odd-indexed terms of the first binomial transform equals 1 and the even-indexed terms of the third binomial transform equals 1, with a(0)=1.
- Let b(0) = 1, b(n) = b(n-1) + (-1)^(n-1)*b(n-1)/10; sequence gives numerator of b(n).A090337
Let b(0) = 1, b(n) = b(n-1) + (-1)^(n-1)*b(n-1)/10; sequence gives numerator of b(n).
- Number of ways of arranging n straight lines in general position in the (affine) plane.A090338
Number of ways of arranging n straight lines in general position in the (affine) plane.
- Number of pseudoline arrangements with n curves.A090339
Number of pseudoline arrangements with n curves.
- Difference between the sums of the prime factors, including multiplicity, of n and those of n + 1.A090340
Difference between the sums of the prime factors, including multiplicity, of n and those of n + 1.
- Difference between the sums of the prime factors, including multiplicity, of n and those of n + 2.A090341
Difference between the sums of the prime factors, including multiplicity, of n and those of n + 2.
- Difference between the sums of the prime factors, including multiplicity, of n and those of n + 3.A090342
Difference between the sums of the prime factors, including multiplicity, of n and those of n + 3.
- Difference between the sums of the prime factors, including multiplicity, of n and those of n + 4.A090343
Difference between the sums of the prime factors, including multiplicity, of n and those of n + 4.
- Number of Motzkin paths of length n with no level steps at odd level.A090344
Number of Motzkin paths of length n with no level steps at odd level.
- Number of Motzkin paths of length n with no level steps at even level.A090345
Number of Motzkin paths of length n with no level steps at even level.
- Number of divisors of prime(n) + prime(n+1).A090346
Number of divisors of prime(n) + prime(n+1).
- Number of labeled trees with n nodes and even number of leaves minus number of labeled trees with n nodes and odd number of leaves.A090347
Number of labeled trees with n nodes and even number of leaves minus number of labeled trees with n nodes and odd number of leaves.
- Norms of prime elements in the ring of integers of Q(sqrt(-7)).A090348
Norms of prime elements in the ring of integers of Q(sqrt(-7)).
- Pascal-like triangle read by rows. Number of nonterminal symbols (which generate strings of length k) in a certain "divide-and-conquer" context-free grammar in Chomsky normal form that generates all permutations of n symbols.A090349
Pascal-like triangle read by rows. Number of nonterminal symbols (which generate strings of length k) in a certain "divide-and-conquer" context-free grammar in Chomsky normal form that generates all permutations of n symbols.
- a(n) = Floor[(n-PrimePi[n])/(2-PrimePi[n]+PrimePi[n-1])].A090350
a(n) = Floor[(n-PrimePi[n])/(2-PrimePi[n]+PrimePi[n-1])].
- G.f. satisfies A^3 = BINOMIAL(A^2).A090351
G.f. satisfies A^3 = BINOMIAL(A^2).
- G.f. satisfies A^3 = BINOMIAL(A)^2, where A = A090351^2.A090352
G.f. satisfies A^3 = BINOMIAL(A)^2, where A = A090351^2.
- G.f. satisfies A^4 = BINOMIAL(A^3).A090353
G.f. satisfies A^4 = BINOMIAL(A^3).
- Self-convolution equals the binomial transform of A090353: A^2 = BINOMIAL(A090353).A090354
Self-convolution equals the binomial transform of A090353: A^2 = BINOMIAL(A090353).
- G.f. satisfies A^4 = BINOMIAL(A)^3.A090355
G.f. satisfies A^4 = BINOMIAL(A)^3.
- G.f. A(x) satisfies A(x)^5 = BINOMIAL(A(x)^4); that is, the binomial transform of the coefficients in A(x)^4 yields the coefficients in A(x)^5.A090356
G.f. A(x) satisfies A(x)^5 = BINOMIAL(A(x)^4); that is, the binomial transform of the coefficients in A(x)^4 yields the coefficients in A(x)^5.
- G.f. satisfies A^5 = BINOMIAL(A)^4; also equals A090356^4.A090357
G.f. satisfies A^5 = BINOMIAL(A)^4; also equals A090356^4.
- G.f. satisfies A^6 = BINOMIAL(A^5).A090358
G.f. satisfies A^6 = BINOMIAL(A^5).
- Self-convolution equals the binomial transform of A090358: A^2 = BINOMIAL(A090358), where A090358^6 = BINOMIAL(A090358^5).A090359
Self-convolution equals the binomial transform of A090358: A^2 = BINOMIAL(A090358), where A090358^6 = BINOMIAL(A090358^5).
- Satisfies A^3 = BINOMIAL(A090358^2), where A090358^6 = BINOMIAL(A090358^5).A090360
Satisfies A^3 = BINOMIAL(A090358^2), where A090358^6 = BINOMIAL(A090358^5).