Sequences
392,541 sequences
- Number of powerful numbers between 2^(n-1)+1 and 2^n.A062761
Number of powerful numbers between 2^(n-1)+1 and 2^n.
- Number of powerful numbers not exceeding 2^n.A062762
Number of powerful numbers not exceeding 2^n.
- a(n) is the greatest common divisor of (n-1)! and n^n.A062763
a(n) is the greatest common divisor of (n-1)! and n^n.
- Number of partitions of the unit square into 2^n dyadic rectangles, each of area 2^{-n}.A062764
Number of partitions of the unit square into 2^n dyadic rectangles, each of area 2^{-n}.
- a(n) = n*(n-1)*(n-3)*(n-5).A062765
a(n) = n*(n-1)*(n-3)*(n-5).
- Number of nonisomorphic cyclic subgroups of general affine group AGL(n,2).A062766
Number of nonisomorphic cyclic subgroups of general affine group AGL(n,2).
- Numbers k such that 3k+1, 3k+5 and 3k+7 are all prime.A062767
Numbers k such that 3k+1, 3k+5 and 3k+7 are all prime.
- Multiples of 6 such that the sum of the digits is equal to 6.A062768
Multiples of 6 such that the sum of the digits is equal to 6.
- Smallest number m such that the continued fraction expansion of sqrt(m) has period 2n + 1.A062769
Smallest number m such that the continued fraction expansion of sqrt(m) has period 2n + 1.
- n/[largest power of squarefree kernel] equals 1; perfect powers of sqf-kernels (or sqf-numbers).A062770
n/[largest power of squarefree kernel] equals 1; perfect powers of sqf-kernels (or sqf-numbers).
- Order of automorphism group of the group C_n X C_2 (where C_n is the cyclic group with n elements).A062771
Order of automorphism group of the group C_n X C_2 (where C_n is the cyclic group with n elements).
- Smallest prime larger than square of n-th prime.A062772
Smallest prime larger than square of n-th prime.
- Index of the smallest prime which follows square of n-th prime.A062773
Index of the smallest prime which follows square of n-th prime.
- Inverse Moebius transform of PrimePi function.A062774
Inverse Moebius transform of PrimePi function.
- Number of Pythagorean triples mod n: total number of solutions to x^2 + y^2 = z^2 mod n.A062775
Number of Pythagorean triples mod n: total number of solutions to x^2 + y^2 = z^2 mod n.
- Greatest common divisor of (n+2)! and n^n.A062776
Greatest common divisor of (n+2)! and n^n.
- a(n) = 2^n - mu(n).A062777
a(n) = 2^n - mu(n).
- Values of Moebius-transform of PrimePi function.A062778
Values of Moebius-transform of PrimePi function.
- a(n) = 2*n*(2*n)!.A062779
a(n) = 2*n*(2*n)!.
- Differences between consecutive prime powers of primes (see A053810).A062780
Differences between consecutive prime powers of primes (see A053810).
- Number of arithmetic progressions of four terms and any mean which can be extracted from the set of the first n positive integers.A062781
Number of arithmetic progressions of four terms and any mean which can be extracted from the set of the first n positive integers.
- a(n) = (n^2)! / (n^n).A062782
a(n) = (n^2)! / (n^n).
- a(n) = 3*n*(4*n-1).A062783
a(n) = 3*n*(4*n-1).
- Numbers k such that sigma(k) + phi(k) is a perfect square.A062784
Numbers k such that sigma(k) + phi(k) is a perfect square.
- a(n) = Chowla's function of n * sigma(n).A062785
a(n) = Chowla's function of n * sigma(n).
- Centered 10-gonal numbers.A062786
Centered 10-gonal numbers.
- a(n) = floor(exp(gamma) n log log n ) - phi(n), where gamma is Euler's constant (A001620).A062787
a(n) = floor(exp(gamma) n log log n ) - phi(n), where gamma is Euler's constant (A001620).
- Squares of the form 5n*(n-1)+1.A062788
Squares of the form 5n*(n-1)+1.
- a(n) = gcd(n, phi(n) * (phi(n) + 1)).A062789
a(n) = gcd(n, phi(n) * (phi(n) + 1)).
- Moebius transform of the cototient function A051953.A062790
Moebius transform of the cototient function A051953.
- Moebius transform of A001405 (binomial(n, floor(n/2))).A062791
Moebius transform of A001405 (binomial(n, floor(n/2))).
- Moebius transform of primorial numbers.A062792
Moebius transform of primorial numbers.
- Moebius transform of n^n.A062793
Moebius transform of n^n.
- Moebius transform of n!.A062794
Moebius transform of n!.
- Duplicate of A062363.A062795
Duplicate of A062363.
- Inverse Moebius transform of f(n) = n^n (A000312).A062796
Inverse Moebius transform of f(n) = n^n (A000312).
- Inverse Moebius transform of f(x) = primorial(x) = A002110(x).A062797
Inverse Moebius transform of f(x) = primorial(x) = A002110(x).
- Inverse Moebius transform of A001405 (binomial(n, floor(n/2))).A062798
Inverse Moebius transform of A001405 (binomial(n, floor(n/2))).
- Inverse Möbius transform of the numbers of distinct prime factors (A001221).A062799
Inverse Möbius transform of the numbers of distinct prime factors (A001221).
- Primes of form 100*k + 1.A062800
Primes of form 100*k + 1.
- Number of 2 X 2 non-singular integer matrices with entries from {0,...,n}.A062801
Number of 2 X 2 non-singular integer matrices with entries from {0,...,n}.
- a(1) = 2; a(n+1) = smallest prime > a(n) whose sum of digits is a(n).A062802
a(1) = 2; a(n+1) = smallest prime > a(n) whose sum of digits is a(n).
- Number of solutions to x^2 == y^2 (mod n).A062803
Number of solutions to x^2 == y^2 (mod n).
- phi(n) - floor(n^(1/3))*tau(n) = 0.A062804
phi(n) - floor(n^(1/3))*tau(n) = 0.
- a(n) = Sum_{i=1..n} i*n^(n-i).A062805
a(n) = Sum_{i=1..n} i*n^(n-i).
- a(n) = Sum_{i=1..n} i*n^i.A062806
a(n) = Sum_{i=1..n} i*n^i.
- a(n) = Sum_{i=1..n} i*(n-i)^i.A062807
a(n) = Sum_{i=1..n} i*(n-i)^i.
- a(n) = Sum_{i=1..n} n^i * (n - i).A062808
a(n) = Sum_{i=1..n} n^i * (n - i).
- a(n) = Sum_{i = 1..n} (n - i)^(1 + i).A062809
a(n) = Sum_{i = 1..n} (n - i)^(1 + i).
- a(n) = Sum_{i=1..n} i^(n - i) + (n - i)^i.A062810
a(n) = Sum_{i=1..n} i^(n - i) + (n - i)^i.