Sequences
392,541 sequences
- Numbers that are the sum of the squares of distinct primes.A048261
Numbers that are the sum of the squares of distinct primes.
- Numbers that aren't the sum of distinct primes of the form 4n+3.A048262
Numbers that aren't the sum of distinct primes of the form 4n+3.
- Numbers that aren't the sum of distinct primes of the form 4n+1.A048263
Numbers that aren't the sum of distinct primes of the form 4n+1.
- Numbers that aren't the sum of distinct primes of the form 6k+5.A048264
Numbers that aren't the sum of distinct primes of the form 6k+5.
- Positive integers that aren't the sum of distinct primes of the form 6k+1.A048265
Positive integers that aren't the sum of distinct primes of the form 6k+1.
- Smallest integer requiring n fifth powers to sum to it.A048266
Smallest integer requiring n fifth powers to sum to it.
- Largest integer requiring n fifth powers to sum to it, starting with n=28.A048267
Largest integer requiring n fifth powers to sum to it, starting with n=28.
- Smallest palindrome greater than n in bases n and n+1.A048268
Smallest palindrome greater than n in bases n and n+1.
- First palindrome greater than n+2 in bases n+2 and n.A048269
First palindrome greater than n+2 in bases n+2 and n.
- Sequence of 2 Pythagorean triangles, each with a leg and hypotenuse prime. The leg of the second triangle is the hypotenuse of the first.A048270
Sequence of 2 Pythagorean triangles, each with a leg and hypotenuse prime. The leg of the second triangle is the hypotenuse of the first.
- a(0) = 1, a(n+1) = -3*a(n) mod 11.A048271
a(0) = 1, a(n+1) = -3*a(n) mod 11.
- Number of odd divisors of n minus number of even divisors of n.A048272
Number of odd divisors of n minus number of even divisors of n.
- Maximal number of distinct prime factors in binomial coefficients C(n,k) for k = 0,...,n.A048273
Maximal number of distinct prime factors in binomial coefficients C(n,k) for k = 0,...,n.
- Let G be the graph with n vertices, the i-th vertex consisting of all multiples of i <= n, where edges indicate that the vertices intersect; a(n) = |n-(number of edges of G)|.A048274
Let G be the graph with n vertices, the i-th vertex consisting of all multiples of i <= n, where edges indicate that the vertices intersect; a(n) = |n-(number of edges of G)|.
- a(n) = maximal value for number of divisors of C(n,k) for k=0..n.A048275
a(n) = maximal value for number of divisors of C(n,k) for k=0..n.
- a(n) = number of squarefree numbers among C(n,k), k=0..n.A048276
a(n) = number of squarefree numbers among C(n,k), k=0..n.
- Number of (not necessarily distinct) nonsquarefree numbers among C(n,k), k=0..n.A048277
Number of (not necessarily distinct) nonsquarefree numbers among C(n,k), k=0..n.
- Positive numbers n such that the numbers binomial(n,k) are squarefree for all k = 0..n.A048278
Positive numbers n such that the numbers binomial(n,k) are squarefree for all k = 0..n.
- Values of n for which no values of C(n,k) except k=0 and k=n are squarefree.A048279
Values of n for which no values of C(n,k) except k=0 and k=n are squarefree.
- Length of longest run of consecutive quadratic residues mod prime(n).A048280
Length of longest run of consecutive quadratic residues mod prime(n).
- Beginning of first run of consecutive quadratic residues mod prime(n) of longest length.A048281
Beginning of first run of consecutive quadratic residues mod prime(n) of longest length.
- Beginning of n consecutive quadratic residues mod A025046(n).A048282
Beginning of n consecutive quadratic residues mod A025046(n).
- For k >= a(n), there are A048284(n) numbers expressible as a sum of exactly k-n k-gonal numbers.A048283
For k >= a(n), there are A048284(n) numbers expressible as a sum of exactly k-n k-gonal numbers.
- For k >= A048283(n), there are a(n) numbers expressible as a sum of exactly k-n k-gonal numbers.A048284
For k >= A048283(n), there are a(n) numbers expressible as a sum of exactly k-n k-gonal numbers.
- Number of Dyck paths of length 2n with nondecreasing peaks.A048285
Number of Dyck paths of length 2n with nondecreasing peaks.
- Eigensequence of a sequence transformation.A048286
Eigensequence of a sequence transformation.
- Number of semiorders on n labeled nodes whose incomparability graph is connected.A048287
Number of semiorders on n labeled nodes whose incomparability graph is connected.
- Number of prime factors counted with multiplicity of the reverse concatenation of numbers from 1 to n.A048288
Number of prime factors counted with multiplicity of the reverse concatenation of numbers from 1 to n.
- Number of Go games with exactly n moves.A048289
Number of Go games with exactly n moves.
- Numbers m that divide Sum_{k=1..m} phi(k).A048290
Numbers m that divide Sum_{k=1..m} phi(k).
- Number of {0,1} n X n matrices with no zero rows or columns.A048291
Number of {0,1} n X n matrices with no zero rows or columns.
- 1-digit terms in the continued fraction for Pi.A048292
1-digit terms in the continued fraction for Pi.
- Positions of 1-digit terms in the continued fraction for Pi (3 is at position 0).A048293
Positions of 1-digit terms in the continued fraction for Pi (3 is at position 0).
- 2-digit terms in the continued fraction for Pi.A048294
2-digit terms in the continued fraction for Pi.
- Sequence of 3 Pythagorean triangles, each with a leg and hypotenuse prime. The hypotenuse of each triangle is the leg of the next triangle.A048295
Sequence of 3 Pythagorean triangles, each with a leg and hypotenuse prime. The hypotenuse of each triangle is the leg of the next triangle.
- Continued fraction for Artin's constant.A048296
Continued fraction for Artin's constant.
- Coefficients in power series expansion over GF(2)[ X^(-1) ] of continued fraction [ 0, X, X^2, X^4, X^8, X^16, ... ].A048297
Coefficients in power series expansion over GF(2)[ X^(-1) ] of continued fraction [ 0, X, X^2, X^4, X^8, X^16, ... ].
- a(n) = n if n=2^i for i >= 0, otherwise a(n) = 0.A048298
a(n) = n if n=2^i for i >= 0, otherwise a(n) = 0.
- Let b(n) = A048273(n) = maximal number of prime factors of C(n,k) for k=0..n; sequence gives smallest value of k achieving b(n).A048299
Let b(n) = A048273(n) = maximal number of prime factors of C(n,k) for k=0..n; sequence gives smallest value of k achieving b(n).
- Numbers whose base-3 expansions, read from left to right, have run lengths that strictly increase.A048300
Numbers whose base-3 expansions, read from left to right, have run lengths that strictly increase.
- Numbers whose base-4 expansions, read from left to right, have run lengths that strictly increase.A048301
Numbers whose base-4 expansions, read from left to right, have run lengths that strictly increase.
- Numbers whose base-5 expansions, read from left to right, have run lengths that strictly increase.A048302
Numbers whose base-5 expansions, read from left to right, have run lengths that strictly increase.
- Numbers whose base-6 expansions, read from left to right, have run lengths that strictly increase.A048303
Numbers whose base-6 expansions, read from left to right, have run lengths that strictly increase.
- Numbers whose base-7 expansions, read from left to right, have run lengths that strictly increase.A048304
Numbers whose base-7 expansions, read from left to right, have run lengths that strictly increase.
- Numbers whose base-8 expansions, read from left to right, have run lengths that strictly increase.A048305
Numbers whose base-8 expansions, read from left to right, have run lengths that strictly increase.
- Numbers whose base-9 expansions, read from left to right, have run lengths that strictly increase.A048306
Numbers whose base-9 expansions, read from left to right, have run lengths that strictly increase.
- Numbers whose decimal expansions, read from left to right, have run lengths that strictly increase.A048307
Numbers whose decimal expansions, read from left to right, have run lengths that strictly increase.
- Numbers whose base-11 expansions, read from left to right, have run lengths that strictly increase.A048308
Numbers whose base-11 expansions, read from left to right, have run lengths that strictly increase.
- Numbers whose base-12 expansions, read from left to right, have run lengths that strictly increase.A048309
Numbers whose base-12 expansions, read from left to right, have run lengths that strictly increase.
- Numbers whose base-13 expansions, read from left to right, have run lengths that strictly increase.A048310
Numbers whose base-13 expansions, read from left to right, have run lengths that strictly increase.