Sequences
392,541 sequences
- Sum of squares of numbers that can be written as t*n + u*(n+1) for nonnegative integers t,u in exactly two ways.A076461
Sum of squares of numbers that can be written as t*n + u*(n+1) for nonnegative integers t,u in exactly two ways.
- Sum of squares of numbers that can be written as t*n + u*(n+1) for nonnegative integers t,u in exactly three ways.A076462
Sum of squares of numbers that can be written as t*n + u*(n+1) for nonnegative integers t,u in exactly three ways.
- Sum of squares of numbers that can be written as t*n + u*(n+1) for nonnegative integers t,u in exactly four ways.A076463
Sum of squares of numbers that can be written as t*n + u*(n+1) for nonnegative integers t,u in exactly four ways.
- Sum of squares of numbers that can be written as t*n + u*(n+1) for nonnegative integers t,u in exactly five ways.A076464
Sum of squares of numbers that can be written as t*n + u*(n+1) for nonnegative integers t,u in exactly five ways.
- Sum of squares of numbers that can be written as t*n + u*(n+1) for nonnegative integers t,u in exactly n ways.A076465
Sum of squares of numbers that can be written as t*n + u*(n+1) for nonnegative integers t,u in exactly n ways.
- a(1)=1 a(n) = a(n-1) + ((-1)^a(n-1)*a(n-1)) mod n.A076466
a(1)=1 a(n) = a(n-1) + ((-1)^a(n-1)*a(n-1)) mod n.
- Perfect powers m^k where m is a positive integer and k >= 3.A076467
Perfect powers m^k where m is a positive integer and k >= 3.
- Perfect powers m^k where k >= 4.A076468
Perfect powers m^k where k >= 4.
- Perfect powers m^k where k >= 5.A076469
Perfect powers m^k where k >= 5.
- Perfect powers m^k where k >= 6.A076470
Perfect powers m^k where k >= 6.
- Number of pairs (p,q) of successive primes with p+q<=n.A076471
Number of pairs (p,q) of successive primes with p+q<=n.
- Number of pairs (p,q) of successive primes with p+q<=n and gcd(p+q,n)>1.A076472
Number of pairs (p,q) of successive primes with p+q<=n and gcd(p+q,n)>1.
- Number of pairs (p,q) of successive primes with p+q<=n and gcd(p+q,n)=1.A076473
Number of pairs (p,q) of successive primes with p+q<=n and gcd(p+q,n)=1.
- Denominators of the slowest decreasing sequence of unit fractions whose partial sums have a prime numerator.A076474
Denominators of the slowest decreasing sequence of unit fractions whose partial sums have a prime numerator.
- Primes in the numerator of the slowest decreasing sequence of unit fractions whose partial sums have a prime numerator.A076475
Primes in the numerator of the slowest decreasing sequence of unit fractions whose partial sums have a prime numerator.
- Fractions a(n)/n are such that gcd(a(n),n)=1, a(n) > 0 and a(n) is as small as possible so that the partial sums of the fractions have prime numerator. Let a(1)=1.A076476
Fractions a(n)/n are such that gcd(a(n),n)=1, a(n) > 0 and a(n) is as small as possible so that the partial sums of the fractions have prime numerator. Let a(1)=1.
- Primes in the numerator of partial sums of A076476.A076477
Primes in the numerator of partial sums of A076476.
- The binary Champernowne sequence: concatenate binary vectors of lengths 1, 2, 3, ... in numerical order.A076478
The binary Champernowne sequence: concatenate binary vectors of lengths 1, 2, 3, ... in numerical order.
- a(n) = mu(rad(n)), where mu is the Moebius-function (A008683) and rad is the radical or squarefree kernel (A007947).A076479
a(n) = mu(rad(n)), where mu is the Moebius-function (A008683) and rad is the radical or squarefree kernel (A007947).
- a(n) = n + mu(rad(n)), where mu is the Moebius function (A008683) and rad is the squarefree kernel (A007947).A076480
a(n) = n + mu(rad(n)), where mu is the Moebius function (A008683) and rad is the squarefree kernel (A007947).
- Primes of the form (3^n-1)/2.A076481
Primes of the form (3^n-1)/2.
- Triangle with T(n,k)=n!*(k-1)^k/k! where 1<=k<=n.A076482
Triangle with T(n,k)=n!*(k-1)^k/k! where 1<=k<=n.
- a(n) = n!*Sum_{k=1..n} (k-1)^k/k!.A076483
a(n) = n!*Sum_{k=1..n} (k-1)^k/k!.
- Balanced numbers k such that 2*k is not a balanced number (k is in A020492, 2*k is not).A076484
Balanced numbers k such that 2*k is not a balanced number (k is in A020492, 2*k is not).
- Solutions to gcd(sigma(x), phi(x)) > gcd(sigma(core(x)), phi(core(x))), i.e., when A009223(x) > A066086(x) or if A066087(x) > 0.A076485
Solutions to gcd(sigma(x), phi(x)) > gcd(sigma(core(x)), phi(core(x))), i.e., when A009223(x) > A066086(x) or if A066087(x) > 0.
- Solutions to gcd(sigma(x), phi(x)) < gcd(sigma(core(x)), phi(core(x))), i.e., when A009223(x) < A066086(x) or if A066087(x) < 0.A076486
Solutions to gcd(sigma(x), phi(x)) < gcd(sigma(core(x)), phi(core(x))), i.e., when A009223(x) < A066086(x) or if A066087(x) < 0.
- Solutions to gcd(sigma(x), phi(x)) = gcd(sigma(core(x)), phi(core(x))), i.e., when A009223(x) = A066086(x) or if A066087(x) = 0.A076487
Solutions to gcd(sigma(x), phi(x)) = gcd(sigma(core(x)), phi(core(x))), i.e., when A009223(x) = A066086(x) or if A066087(x) = 0.
- Nonsquarefree solutions to gcd(sigma(x), phi(x)) = gcd(sigma(core(x)), Phi(core(x))), i.e., when A009223(x) = A066086(x) or if A066087(x)=0 and mu(x)=0.A076488
Nonsquarefree solutions to gcd(sigma(x), phi(x)) = gcd(sigma(core(x)), Phi(core(x))), i.e., when A009223(x) = A066086(x) or if A066087(x)=0 and mu(x)=0.
- Number of common (distinct) digits of consecutive natural numbers.A076489
Number of common (distinct) digits of consecutive natural numbers.
- Number of common (distinct) digits of consecutive prime numbers.A076490
Number of common (distinct) digits of consecutive prime numbers.
- a(2*n), a(2*n+1) is the smallest consecutive prime pairs with at least n distinct common decimal digits.A076491
a(2*n), a(2*n+1) is the smallest consecutive prime pairs with at least n distinct common decimal digits.
- Number of common decimal digits of n! and (n+1)!.A076492
Number of common decimal digits of n! and (n+1)!.
- Number of common (distinct) decimal digits of n and n^2.A076493
Number of common (distinct) decimal digits of n and n^2.
- Number of common decimal digits of 2^n and 2^(1+n).A076494
Number of common decimal digits of 2^n and 2^(1+n).
- Smallest x such that sigma(x) mod x = n, or 0 if no such x exists.A076495
Smallest x such that sigma(x) mod x = n, or 0 if no such x exists.
- Numbers k such that sigma(k) == 12 (mod k).A076496
Numbers k such that sigma(k) == 12 (mod k).
- Number of primes corresponding to n-th primeval number A072857(n).A076497
Number of primes corresponding to n-th primeval number A072857(n).
- Class number h(p) of real quadratic field Q(sqrt(p)) where p is n-th prime == 1 mod 4.A076498
Class number h(p) of real quadratic field Q(sqrt(p)) where p is n-th prime == 1 mod 4.
- Partial sums of A076498.A076499
Partial sums of A076498.
- Distance between natural sculptures.A076500
Distance between natural sculptures.
- Erroneous version of A086758.A076501
Erroneous version of A086758.
- a(1)=1, a(n)=n-a(n-a(n-a(n-1))).A076502
a(1)=1, a(n)=n-a(n-a(n-a(n-1))).
- Prime numbers whose squares have square digit-sums.A076503
Prime numbers whose squares have square digit-sums.
- Numbers k such that (k-1, k+1) and (k/2-1, k/2+1) are both pairs of twin primes.A076504
Numbers k such that (k-1, k+1) and (k/2-1, k/2+1) are both pairs of twin primes.
- 3 people at a party are saying Hello to each other. Person 1 says Hello. Person 2 counts the times Hello has been said and says Hello twice that number. Person 3 says Hello 3 times the sum of Hello's and then it is Person 1 again. This is how many Hello's each person says.A076505
3 people at a party are saying Hello to each other. Person 1 says Hello. Person 2 counts the times Hello has been said and says Hello twice that number. Person 3 says Hello 3 times the sum of Hello's and then it is Person 1 again. This is how many Hello's each person says.
- Expansion of x*(1+3*x+12*x^2)/(1-24*x^3).A076506
Expansion of x*(1+3*x+12*x^2)/(1-24*x^3).
- Three people (P1, P2, P3) are in a circle and are saying Hello to each other. They start with P2 saying "Hello, Hello". Thereafter Pn says "Hello" for n times the total number of Hello's so far.A076507
Three people (P1, P2, P3) are in a circle and are saying Hello to each other. They start with P2 saying "Hello, Hello". Thereafter Pn says "Hello" for n times the total number of Hello's so far.
- Expansion of 2*x*(1+4*x+8*x^2)/(1-24*x^3).A076508
Expansion of 2*x*(1+4*x+8*x^2)/(1-24*x^3).
- Expansion of 3*x*(1-x)*(1+2*x+6*x^2)/(1-24*x^3).A076509
Expansion of 3*x*(1-x)*(1+2*x+6*x^2)/(1-24*x^3).
- Expansion of 3*(1+2*x+6 x^2)/(1-24*x^3).A076510
Expansion of 3*(1+2*x+6 x^2)/(1-24*x^3).