Sequences
392,541 sequences
- Primes (in order) occurring in A053810.A053811
Primes (in order) occurring in A053810.
- Exponents occurring in A053810.A053812
Exponents occurring in A053810.
- Numbers which are an integral multiple of the sum of their proper divisors: prime and perfect numbers.A053813
Numbers which are an integral multiple of the sum of their proper divisors: prime and perfect numbers.
- a(n) = n modulo (sum of proper divisors of n).A053814
a(n) = n modulo (sum of proper divisors of n).
- Floor(n / (sum of proper divisors of n)).A053815
Floor(n / (sum of proper divisors of n)).
- Another version of the Kaprekar numbers (A006886): n such that n = q+r and n^2 = q*10^m+r, for some m >= 1, q >= 0 and 0 <= r < 10^m, with n != 10^a, a >= 1 and n an m-digit number.A053816
Another version of the Kaprekar numbers (A006886): n such that n = q+r and n^2 = q*10^m+r, for some m >= 1, q >= 0 and 0 <= r < 10^m, with n != 10^a, a >= 1 and n an m-digit number.
- a(0)=1, a(n) = n*(a(n-1) + n).A053817
a(0)=1, a(n) = n*(a(n-1) + n).
- a(n) = Sum_{k=1..n, gcd(n,k) = 1} k^2.A053818
a(n) = Sum_{k=1..n, gcd(n,k) = 1} k^2.
- a(n) = Sum_{k=1..n, gcd(n,k) = 1} k^3.A053819
a(n) = Sum_{k=1..n, gcd(n,k) = 1} k^3.
- a(n) = Sum_{k=1..n, gcd(n,k) = 1} k^4.A053820
a(n) = Sum_{k=1..n, gcd(n,k) = 1} k^4.
- A discrete approximation to log(n): Sum_{ d divides n } A029833(d).A053821
A discrete approximation to log(n): Sum_{ d divides n } A029833(d).
- Dirichlet inverse of sigma_2 function (A001157).A053822
Dirichlet inverse of sigma_2 function (A001157).
- Product of primes in n-th shell of prime spiral.A053823
Product of primes in n-th shell of prime spiral.
- Sum of digits of (n written in base 5).A053824
Sum of digits of (n written in base 5).
- Dirichlet inverse of sigma_3 function (A001158).A053825
Dirichlet inverse of sigma_3 function (A001158).
- Dirichlet inverse of sigma_4 function (A001159).A053826
Dirichlet inverse of sigma_4 function (A001159).
- Sum of digits of (n written in base 6).A053827
Sum of digits of (n written in base 6).
- Sum of digits of (n written in base 7).A053828
Sum of digits of (n written in base 7).
- Sum of digits of (n written in base 8).A053829
Sum of digits of (n written in base 8).
- Sum of digits of (n written in base 9).A053830
Sum of digits of (n written in base 9).
- Sum of digits of n written in base 11.A053831
Sum of digits of n written in base 11.
- Sum of digits of n written in base 12.A053832
Sum of digits of n written in base 12.
- Sum of digits of n written in base 13.A053833
Sum of digits of n written in base 13.
- Sum of digits of n written in base 14.A053834
Sum of digits of n written in base 14.
- Sum of digits of n written in base 15.A053835
Sum of digits of n written in base 15.
- Sum of digits of n written in base 16.A053836
Sum of digits of n written in base 16.
- Sum of digits of n modulo 10.A053837
Sum of digits of n modulo 10.
- a(n) = (sum of digits of n written in base 3) modulo 3.A053838
a(n) = (sum of digits of n written in base 3) modulo 3.
- a(n) = (sum of digits of n written in base 4) modulo 4.A053839
a(n) = (sum of digits of n written in base 4) modulo 4.
- (Sum of digits of n written in base 5) modulo 5.A053840
(Sum of digits of n written in base 5) modulo 5.
- (Sum of digits of n written in base 6) modulo 6.A053841
(Sum of digits of n written in base 6) modulo 6.
- (Sum of digits of n written in base 7) modulo 7.A053842
(Sum of digits of n written in base 7) modulo 7.
- (Sum of digits of n written in base 8) modulo 8.A053843
(Sum of digits of n written in base 8) modulo 8.
- (Sum of digits of n written in base 9) modulo 9.A053844
(Sum of digits of n written in base 9) modulo 9.
- Primes of form prime(1) + ... + prime(k) + 1.A053845
Primes of form prime(1) + ... + prime(k) + 1.
- Number of n X n matrices over GF(3) of order dividing 2 (i.e., number of solutions of X^2=I in GL(n,3)).A053846
Number of n X n matrices over GF(3) of order dividing 2 (i.e., number of solutions of X^2=I in GL(n,3)).
- Number of n X n matrices over GF(3) of order dividing 3 (i.e., number of solutions of X^3=I in GL(n,3)).A053847
Number of n X n matrices over GF(3) of order dividing 3 (i.e., number of solutions of X^3=I in GL(n,3)).
- Number of n X n matrices over GF(3) of order dividing 4 (i.e., number of solutions of X^4=I in GL(n,3)).A053848
Number of n X n matrices over GF(3) of order dividing 4 (i.e., number of solutions of X^4=I in GL(n,3)).
- Number of n X n matrices over GF(3) of order dividing 5 (i.e., number of solutions of X^5=I in GL(n,3)).A053849
Number of n X n matrices over GF(3) of order dividing 5 (i.e., number of solutions of X^5=I in GL(n,3)).
- Odd numbers divisible by a square > 1.A053850
Odd numbers divisible by a square > 1.
- Number of n X n matrices over GF(3) of order dividing 6 (i.e., number of solutions of X^6=I in GL(n,3)).A053851
Number of n X n matrices over GF(3) of order dividing 6 (i.e., number of solutions of X^6=I in GL(n,3)).
- Number of n X n matrices over GF(3) of order dividing 7 (i.e., number of solutions of X^7=I in GL(n,3)).A053852
Number of n X n matrices over GF(3) of order dividing 7 (i.e., number of solutions of X^7=I in GL(n,3)).
- Number of n X n matrices over GF(3) of order dividing 8 (i.e., number of solutions of X^8=I in GL(n,3)).A053853
Number of n X n matrices over GF(3) of order dividing 8 (i.e., number of solutions of X^8=I in GL(n,3)).
- Number of n X n matrices over GF(3) of order dividing 9, i.e., the number of solutions to X^9=I in GL(n,3).A053854
Number of n X n matrices over GF(3) of order dividing 9, i.e., the number of solutions to X^9=I in GL(n,3).
- Number of n X n matrices over GF(3) of order dividing 10 (i.e., number of solutions of X^10=I in GL(n,3)).A053855
Number of n X n matrices over GF(3) of order dividing 10 (i.e., number of solutions of X^10=I in GL(n,3)).
- Number of n X n matrices over GF(4) of order dividing 2 (i.e., number of solutions of X^2=I in GL(n,4)).A053856
Number of n X n matrices over GF(4) of order dividing 2 (i.e., number of solutions of X^2=I in GL(n,4)).
- Number of n X n matrices over GF(4) of order dividing 3 (i.e., number of solutions of X^3=I in GL(n,4)).A053857
Number of n X n matrices over GF(4) of order dividing 3 (i.e., number of solutions of X^3=I in GL(n,4)).
- Squarefree even composite numbers with an odd number of prime factors.A053858
Squarefree even composite numbers with an odd number of prime factors.
- Number of n X n matrices over GF(4) of order dividing 4 (i.e., number of solutions of X^4=I in GL(n,4)).A053859
Number of n X n matrices over GF(4) of order dividing 4 (i.e., number of solutions of X^4=I in GL(n,4)).
- Number of n X n matrices over GF(4) of order dividing 5 (i.e., number of solutions of X^5=I in GL(n,4)).A053860
Number of n X n matrices over GF(4) of order dividing 5 (i.e., number of solutions of X^5=I in GL(n,4)).