Sequences
392,541 sequences
- a(n) = Sum_{d|n, n/d=1 mod 4} d^2.A050461
a(n) = Sum_{d|n, n/d=1 mod 4} d^2.
- a(n) = Sum_{d|n, n/d=1 mod 4} d^3.A050462
a(n) = Sum_{d|n, n/d=1 mod 4} d^3.
- a(n) = Sum_{d|n, n/d=1 mod 4} d^4.A050463
a(n) = Sum_{d|n, n/d=1 mod 4} d^4.
- a(n) = Sum_{d|n, n/d=3 mod 4} d.A050464
a(n) = Sum_{d|n, n/d=3 mod 4} d.
- a(n) = Sum_{d|n, n/d=3 mod 4} d^2.A050465
a(n) = Sum_{d|n, n/d=3 mod 4} d^2.
- a(n) = Sum_{d|n, n/d=3 mod 4} d^3.A050466
a(n) = Sum_{d|n, n/d=3 mod 4} d^3.
- a(n) = Sum_{d|n, n/d=3 mod 4} d^4.A050467
a(n) = Sum_{d|n, n/d=3 mod 4} d^4.
- a(n) = Sum_{d|n, n/d=1 mod 4} d^4 - Sum_{d|n, n/d=3 mod 4} d^4.A050468
a(n) = Sum_{d|n, n/d=1 mod 4} d^4 - Sum_{d|n, n/d=3 mod 4} d^4.
- a(n) = Sum_{ d divides n, n/d=1 mod 4} d - Sum_{ d divides n, n/d=3 mod 4} d.A050469
a(n) = Sum_{ d divides n, n/d=1 mod 4} d - Sum_{ d divides n, n/d=3 mod 4} d.
- a(n) = Sum_{d|n, n/d == 1 (mod 4)} d^2 - Sum_{d|n, n/d == 3 (mod 4)} d^2.A050470
a(n) = Sum_{d|n, n/d == 1 (mod 4)} d^2 - Sum_{d|n, n/d == 3 (mod 4)} d^2.
- a(n) = Sum_{d|n, n/d=1 mod 4} d^3 - Sum_{d|n, n/d=3 mod 4} d^3.A050471
a(n) = Sum_{d|n, n/d=1 mod 4} d^3 - Sum_{d|n, n/d=3 mod 4} d^3.
- Numbers m such that 2*phi(m) = phi(m+1).A050472
Numbers m such that 2*phi(m) = phi(m+1).
- Smallest k such that phi(k+n) = 2*phi(k).A050473
Smallest k such that phi(k+n) = 2*phi(k).
- Solutions to 2*phi(x) = x+1.A050474
Solutions to 2*phi(x) = x+1.
- Numbers k such that x = 2^k-2 satisfies phi(x)+2 = phi(x+2).A050475
Numbers k such that x = 2^k-2 satisfies phi(x)+2 = phi(x+2).
- a(n) = C(n)*(6*n + 1) where C(n) = Catalan numbers (A000108).A050476
a(n) = C(n)*(6*n + 1) where C(n) = Catalan numbers (A000108).
- a(n) = C(n)*(7*n + 1) where C(n) = Catalan numbers (A000108).A050477
a(n) = C(n)*(7*n + 1) where C(n) = Catalan numbers (A000108).
- a(n) = C(n)*(8*n+1) where C(n) = Catalan numbers (A000108).A050478
a(n) = C(n)*(8*n+1) where C(n) = Catalan numbers (A000108).
- a(n) = C(n)*(9*n + 1) where C(n) = Catalan numbers (A000108).A050479
a(n) = C(n)*(9*n + 1) where C(n) = Catalan numbers (A000108).
- Numbers that can be written as a concatenation of distinct proper divisors.A050480
Numbers that can be written as a concatenation of distinct proper divisors.
- The first, second, fourth, sixth, seventh, ... letters in this sentence are consonants (ignoring spaces and commas).A050481
The first, second, fourth, sixth, seventh, ... letters in this sentence are consonants (ignoring spaces and commas).
- Sum of remainders when n-th prime is divided by all preceding integers.A050482
Sum of remainders when n-th prime is divided by all preceding integers.
- Partial sums of A051947.A050483
Partial sums of A051947.
- Partial sums of A051946.A050484
Partial sums of A051946.
- Duplicate of A034265.A050485
Duplicate of A034265.
- a(n) = binomial(n+6,6)*(2n+7)/7.A050486
a(n) = binomial(n+6,6)*(2n+7)/7.
- Geometric Connell sequence: start with 1; then next two numbers == 2 mod 3; next four == 3 mod 3; next eight == 1 mod 3; etc.A050487
Geometric Connell sequence: start with 1; then next two numbers == 2 mod 3; next four == 3 mod 3; next eight == 1 mod 3; etc.
- a(n) = 3*(2^n-1) - 2*n.A050488
a(n) = 3*(2^n-1) - 2*n.
- a(n) = C(n)*(10*n + 1) where C(n) = Catalan numbers (A000108).A050489
a(n) = C(n)*(10*n + 1) where C(n) = Catalan numbers (A000108).
- a(n) = C(n)*(11n+1) where C(n) = Catalan numbers (A000108).A050490
a(n) = C(n)*(11n+1) where C(n) = Catalan numbers (A000108).
- a(n) = C(n)*(12n+1) where C(n) = Catalan numbers (A000108).A050491
a(n) = C(n)*(12n+1) where C(n) = Catalan numbers (A000108).
- Thickened cube numbers: a(n) = n*(n^2 + (n-1)^2) + (n-1)*2*n*(n-1).A050492
Thickened cube numbers: a(n) = n*(n^2 + (n-1)^2) + (n-1)*2*n*(n-1).
- a(n) = sum of binary digits of n-th triangular number.A050493
a(n) = sum of binary digits of n-th triangular number.
- Partial sums of A051923.A050494
Partial sums of A051923.
- Numbers that are the first term of at least one arithmetic progression with 4 or more terms all having the same value of Euler's totient function phi(x).A050495
Numbers that are the first term of at least one arithmetic progression with 4 or more terms all having the same value of Euler's totient function phi(x).
- Increments in arithmetic progressions of at least 4 terms having the same value of phi(x) in A050495.A050496
Increments in arithmetic progressions of at least 4 terms having the same value of phi(x) in A050495.
- Values of phi(x) in arithmetic progressions of at least 4 terms having the same value of phi(x) in A050495.A050497
Values of phi(x) in arithmetic progressions of at least 4 terms having the same value of phi(x) in A050495.
- Arithmetic progressions of at least 4 terms with common difference 6 having the same value of phi(x) start at these numbers.A050498
Arithmetic progressions of at least 4 terms with common difference 6 having the same value of phi(x) start at these numbers.
- Nearest integer to n/log(n).A050499
Nearest integer to n/log(n).
- Integer part of n/log(n).A050500
Integer part of n/log(n).
- a(n) = ceiling(n/log(n)).A050501
a(n) = ceiling(n/log(n)).
- a(n) = ceiling(n*log(n)).A050502
a(n) = ceiling(n*log(n)).
- Nearest integer to n*log(n).A050503
Nearest integer to n*log(n).
- Integer part of n*log(n).A050504
Integer part of n*log(n).
- Unlucky numbers.A050505
Unlucky numbers.
- Nearest integer to log(Fibonacci(n)).A050506
Nearest integer to log(Fibonacci(n)).
- Solutions to sigma(x)+2=sigma(x+2) other than the smaller of twin primes.A050507
Solutions to sigma(x)+2=sigma(x+2) other than the smaller of twin primes.
- Golden rectangle numbers: n * A007067(n).A050508
Golden rectangle numbers: n * A007067(n).
- House numbers (version 2): a(n) = (n+1)^3 + (n+1)*Sum_{i=0..n} i.A050509
House numbers (version 2): a(n) = (n+1)^3 + (n+1)*Sum_{i=0..n} i.
- Golden rectangular box numbers: a(n) = n*A007067(n)*A007067(A007067(n)).A050510
Golden rectangular box numbers: a(n) = n*A007067(n)*A007067(A007067(n)).