Sequences
392,541 sequences
- Multiples of 9 with digits grouped in pairs and leading zeros omitted.A087411
Multiples of 9 with digits grouped in pairs and leading zeros omitted.
- a(n) is the number of solutions to x^3 + y^3 == 1 (mod n).A087412
a(n) is the number of solutions to x^3 + y^3 == 1 (mod n).
- a(n) = Sum_{k=1..n} C(3*k,k)/3.A087413
a(n) = Sum_{k=1..n} C(3*k,k)/3.
- Numbers n such that 2*n*k(n) is rational but not an integer, where k(n) is sum of successive remainders when computing the Euclidean algorithm for (1, 1/sqrt(n)) as defined in A086378 (MuPAD program is given there); numbers belonging to A086378 but not to A088900.A087414
Numbers n such that 2*n*k(n) is rational but not an integer, where k(n) is sum of successive remainders when computing the Euclidean algorithm for (1, 1/sqrt(n)) as defined in A086378 (MuPAD program is given there); numbers belonging to A086378 but not to A088900.
- Odd numbers k such that abs(sigma(k)-2k) <= sqrt(k). Abundance-radius = abs(sigma(k)-2k) does not exceed square root of k and k is odd.A087415
Odd numbers k such that abs(sigma(k)-2k) <= sqrt(k). Abundance-radius = abs(sigma(k)-2k) does not exceed square root of k and k is odd.
- Take unbounded lunar divisors of n as defined in A087029, add them using lunar addition. See A087083 for their conventional sum.A087416
Take unbounded lunar divisors of n as defined in A087029, add them using lunar addition. See A087083 for their conventional sum.
- Sum of the cubes of A058182.A087417
Sum of the cubes of A058182.
- Consider pairs (p,k) such that p is a prime, q and r are the two primes following p, 0<k<q and k*primorial(p)+q and k*primorial(p)+r are consecutive primes; sequence gives values of p.A087418
Consider pairs (p,k) such that p is a prime, q and r are the two primes following p, 0<k<q and k*primorial(p)+q and k*primorial(p)+r are consecutive primes; sequence gives values of p.
- Consider pairs (p,k) such that p is a prime, q and r are the two primes following p, 0<k<q and k*primorial(p)+q and k*primorial(p)+r are consecutive primes; sequence gives values of k.A087419
Consider pairs (p,k) such that p is a prime, q and r are the two primes following p, 0<k<q and k*primorial(p)+q and k*primorial(p)+r are consecutive primes; sequence gives values of k.
- a(n) is the sum of the squares of the sizes of the conjugacy classes in the dihedral group D_2n.A087420
a(n) is the sum of the squares of the sizes of the conjugacy classes in the dihedral group D_2n.
- Smallest prime >= n!.A087421
Smallest prime >= n!.
- Number of terms in the expansion of Product(x_i + x_{i+1} + ... + x_j) over 1 <= i < j <= n.A087422
Number of terms in the expansion of Product(x_i + x_{i+1} + ... + x_j) over 1 <= i < j <= n.
- a(n) = S(3*n,3)/S(n,3) where S(n,m) = Sum_{k=0..n} binomial(n,k)*Fibonacci(m*k).A087423
a(n) = S(3*n,3)/S(n,3) where S(n,m) = Sum_{k=0..n} binomial(n,k)*Fibonacci(m*k).
- a(n) = S(4*n,4)/S(n,4) where S(n,m) = Sum_{k=0..n} binomial(n,k)*Fibonacci(m*k).A087424
a(n) = S(4*n,4)/S(n,4) where S(n,m) = Sum_{k=0..n} binomial(n,k)*Fibonacci(m*k).
- a(n) = S(5*n,5)/S(n,5) where S(n,m) = Sum_{k=0..n} binomial(n,k)*Fibonacci(m*k).A087425
a(n) = S(5*n,5)/S(n,5) where S(n,m) = Sum_{k=0..n} binomial(n,k)*Fibonacci(m*k).
- a(n) = S(n,4) where S(n,m) = Sum_{k=0..n} binomial(n,k)*Fibonacci(m*k).A087426
a(n) = S(n,4) where S(n,m) = Sum_{k=0..n} binomial(n,k)*Fibonacci(m*k).
- Number of lattice points on or inside the rectangle formed by [1 <= x <= (q-1)/2] and [1 <= y <= (p-1)/2], where p = n-th prime, q = (n-1)-st prime.A087427
Number of lattice points on or inside the rectangle formed by [1 <= x <= (q-1)/2] and [1 <= y <= (p-1)/2], where p = n-th prime, q = (n-1)-st prime.
- a(n) = [(p-1)/2 * (q-1)/2] mod p where p = (n+1)th odd prime, q = n-th odd prime.A087428
a(n) = [(p-1)/2 * (q-1)/2] mod p where p = (n+1)th odd prime, q = n-th odd prime.
- a(n) = 1 if gpf(n) < gpf(n+1), otherwise 0, where gpf = A006530 (greatest prime factor).A087429
a(n) = 1 if gpf(n) < gpf(n+1), otherwise 0, where gpf = A006530 (greatest prime factor).
- Nonprimes n with gpf(n) > gpf(n+1), where gpf=A006530 (greatest prime factor).A087430
Nonprimes n with gpf(n) > gpf(n+1), where gpf=A006530 (greatest prime factor).
- a(n) = 0^n/2 + 2^n*(n^2+n+2)/4.A087431
a(n) = 0^n/2 + 2^n*(n^2+n+2)/4.
- Expansion of 1+x*(1-x-4*x^2)/((1+x)*(1-2*x)*(1-3*x)).A087432
Expansion of 1+x*(1-x-4*x^2)/((1+x)*(1-2*x)*(1-3*x)).
- Expansion of g.f.: (1-2*x)*(1-4*x+x^2)/((1-x)*(1-3*x)*(1-4*x)).A087433
Expansion of g.f.: (1-2*x)*(1-4*x+x^2)/((1-x)*(1-3*x)*(1-4*x)).
- Number of brilliant numbers whose prime factors each have n digits.A087434
Number of brilliant numbers whose prime factors each have n digits.
- Partial sums of A087434.A087435
Partial sums of A087434.
- Number of odd prime factors of n, counted with repetitions.A087436
Number of odd prime factors of n, counted with repetitions.
- A077565 indexed by A025487.A087437
A077565 indexed by A025487.
- a(n) = 3*2^(2*(n-1)) + 2^(n-2)*(n+1).A087438
a(n) = 3*2^(2*(n-1)) + 2^(n-2)*(n+1).
- Expansion of (1-4x)/((1-x)(1-3x)(1-5x)).A087439
Expansion of (1-4x)/((1-x)(1-3x)(1-5x)).
- Expansion of (1-2*x-3*x^2)/((1-2*x)*(1-4*x)).A087440
Expansion of (1-2*x-3*x^2)/((1-2*x)*(1-4*x)).
- Numbers k such that for every prime divisor p of k, p-1 divides k-1.A087441
Numbers k such that for every prime divisor p of k, p-1 divides k-1.
- Numbers n such that n is not the power of a prime and such that for every prime divisor p of n, p-1 divides n-1.A087442
Numbers n such that n is not the power of a prime and such that for every prime divisor p of n, p-1 divides n-1.
- Least integer of each prime signature ordered first by sum of exponents and then by least integer value.A087443
Least integer of each prime signature ordered first by sum of exponents and then by least integer value.
- Numbers that are congruent to {1, 4} mod 9.A087444
Numbers that are congruent to {1, 4} mod 9.
- Numbers that are congruent to 1 or 5 mod 12.A087445
Numbers that are congruent to 1 or 5 mod 12.
- Numbers that are congruent to {1, 6} mod 15.A087446
Numbers that are congruent to {1, 6} mod 15.
- a(0) = a(1) = 1; for n > 1, a(n) = (n+2)*2^(n-2).A087447
a(0) = a(1) = 1; for n > 1, a(n) = (n+2)*2^(n-2).
- 3^(n-1)(n+3)/2-(n-1)/2.A087448
3^(n-1)(n+3)/2-(n-1)/2.
- a(n) = n * 4^(n-1) + (2*4^n + 1) / 3.A087449
a(n) = n * 4^(n-1) + (2*4^n + 1) / 3.
- Smallest number (see comment for representation) with all identical digits having n distinct prime divisors.A087450
Smallest number (see comment for representation) with all identical digits having n distinct prime divisors.
- G.f.: (2-x)/((1+2x)(1-3x)); e.g.f.: exp(3x)+exp(-2x); a(n)=3^n+(-2)^n.A087451
G.f.: (2-x)/((1+2x)(1-3x)); e.g.f.: exp(3x)+exp(-2x); a(n)=3^n+(-2)^n.
- G.f.: (2-x)/((1+3x)(1-4x)); e.g.f.: exp(4x) + exp(-3x); a(n) = 4^n + (-3)^n.A087452
G.f.: (2-x)/((1+3x)(1-4x)); e.g.f.: exp(4x) + exp(-3x); a(n) = 4^n + (-3)^n.
- a(n) = S(n,5), where S(n,m) = Sum_{k=0..n} binomial(n,k)*Fibonacci(m*k).A087453
a(n) = S(n,5), where S(n,m) = Sum_{k=0..n} binomial(n,k)*Fibonacci(m*k).
- Multiplicative inverse of the n-th prime prime(n) modulo prime(n-1).A087454
Multiplicative inverse of the n-th prime prime(n) modulo prime(n-1).
- Expansion of (1 - x)/(1 - 2*x + 3*x^2) in powers of x.A087455
Expansion of (1 - x)/(1 - 2*x + 3*x^2) in powers of x.
- Palindromic hypotenuses in primitive Pythagorean triples.A087456
Palindromic hypotenuses in primitive Pythagorean triples.
- Number of odd length roads between any adjacent nodes in virtual optimal chordal ring of degree 3 (the length of chord < number of nodes/2).A087457
Number of odd length roads between any adjacent nodes in virtual optimal chordal ring of degree 3 (the length of chord < number of nodes/2).
- Greatest prime p such that prime(n)+p <= prime(n+1); a(1)=1.A087458
Greatest prime p such that prime(n)+p <= prime(n+1); a(1)=1.
- Values (X + Y - Z) sorted on Z, then on Y, where (X,Y,Z) is a primitive Pythagorean triple with X<Y<Z.A087459
Values (X + Y - Z) sorted on Z, then on Y, where (X,Y,Z) is a primitive Pythagorean triple with X<Y<Z.
- Least n such that H(n) is closer to an integer than any H(j) with j < n; where H(n) is the harmonic number sum_{i=0..n} 1/i.A087460
Least n such that H(n) is closer to an integer than any H(j) with j < n; where H(n) is the harmonic number sum_{i=0..n} 1/i.