Sequences
392,541 sequences
- n is not divisible by the number of its proper divisors.A054011
n is not divisible by the number of its proper divisors.
- Nonzero values of n read modulo (number of proper divisors of n).A054012
Nonzero values of n read modulo (number of proper divisors of n).
- Chowla function of n read modulo n.A054013
Chowla function of n read modulo n.
- Chowla function of n read modulo (the number of divisors of n).A054014
Chowla function of n read modulo (the number of divisors of n).
- a(n) is Chowla function of n read modulo (number of proper divisors of n), a(1) = 0 by convention.A054015
a(n) is Chowla function of n read modulo (number of proper divisors of n), a(1) = 0 by convention.
- a(n) = smallest nonnegative integer not the Nim sum of at most 4 earlier terms.A054016
a(n) = smallest nonnegative integer not the Nim sum of at most 4 earlier terms.
- Chowla's function of n modulo n is a square (excluding 0's).A054017
Chowla's function of n modulo n is a square (excluding 0's).
- Squares mentioned in A054017.A054018
Squares mentioned in A054017.
- Square roots of A054018.A054019
Square roots of A054018.
- Chowla's function of n is not divisible by the number of proper divisors of n.A054020
Chowla's function of n is not divisible by the number of proper divisors of n.
- Numbers n such that Chowla's function of n is divisible by the number of proper divisors of n.A054021
Numbers n such that Chowla's function of n is divisible by the number of proper divisors of n.
- Chowla function of n is divisible by the number of divisors of n.A054022
Chowla function of n is divisible by the number of divisors of n.
- Chowla function of n is not divisible by the number of divisors of n.A054023
Chowla function of n is not divisible by the number of divisors of n.
- Sum of the divisors of n reduced modulo n.A054024
Sum of the divisors of n reduced modulo n.
- Sum of divisors of n read modulo (number of divisors of n).A054025
Sum of divisors of n read modulo (number of divisors of n).
- a(n) is the number of sets of natural numbers [a,b,c,d,e] that can be produced with the numbers [0..n] such that the values of all the distinct parenthesized expressions of a-b-c-d-e are different.A054026
a(n) is the number of sets of natural numbers [a,b,c,d,e] that can be produced with the numbers [0..n] such that the values of all the distinct parenthesized expressions of a-b-c-d-e are different.
- Numbers that do not divide their sum of divisors.A054027
Numbers that do not divide their sum of divisors.
- a(n) = first k such that 2^k >= k^n, (for n >= 2, k >= 2).A054028
a(n) = first k such that 2^k >= k^n, (for n >= 2, k >= 2).
- First differences of A054028.A054029
First differences of A054028.
- Sigma(n)/n for n such that sigma(n) is divisible by n.A054030
Sigma(n)/n for n such that sigma(n) is divisible by n.
- Numbers whose square contains exactly 3 distinct digits.A054031
Numbers whose square contains exactly 3 distinct digits.
- Numbers n such that n^2 contains exactly 4 different digits.A054032
Numbers n such that n^2 contains exactly 4 different digits.
- Numbers n such that n^2 contains exactly 5 different digits.A054033
Numbers n such that n^2 contains exactly 5 different digits.
- Numbers n such that n^2 contains exactly 6 different digits.A054034
Numbers n such that n^2 contains exactly 6 different digits.
- Numbers n such that n^2 contains exactly 7 different digits.A054035
Numbers n such that n^2 contains exactly 7 different digits.
- Numbers n such that n^2 contains exactly 8 different digits.A054036
Numbers n such that n^2 contains exactly 8 different digits.
- Numbers k such that k^2 contains exactly 9 different digits.A054037
Numbers k such that k^2 contains exactly 9 different digits.
- Numbers k such that k^2 contains every digit at least once.A054038
Numbers k such that k^2 contains every digit at least once.
- a(n)^2 is the least square to contain n different decimal digits.A054039
a(n)^2 is the least square to contain n different decimal digits.
- a(n) terms of series {1/sqrt(j)} are >= n.A054040
a(n) terms of series {1/sqrt(j)} are >= n.
- Sum of a(n) terms of 1/k^(1/3) first exceeds n.A054041
Sum of a(n) terms of 1/k^(1/3) first exceeds n.
- Decimal expansion of 1 - 1/sqrt(10).A054042
Decimal expansion of 1 - 1/sqrt(10).
- Grundy function for turn-at-most-6-coins game.A054043
Grundy function for turn-at-most-6-coins game.
- Grundy function for turn-at-most-7-coins game.A054044
Grundy function for turn-at-most-7-coins game.
- Grundy function for turn-at-most-8-coins game.A054045
Grundy function for turn-at-most-8-coins game.
- Grundy function for turn-at-most-9-coins game.A054046
Grundy function for turn-at-most-9-coins game.
- Numbers which can be read as (possibly different) numbers when rotated by 180 degrees (final zeros allowed).A054047
Numbers which can be read as (possibly different) numbers when rotated by 180 degrees (final zeros allowed).
- Earliest sequence with a(a(n)) = n*(n+1)/2 (Triangular numbers).A054048
Earliest sequence with a(a(n)) = n*(n+1)/2 (Triangular numbers).
- Earliest sequence with a(a(n)) = Fibonacci(n+1).A054049
Earliest sequence with a(a(n)) = Fibonacci(n+1).
- Number of nonisomorphic binary n-state automata.A054050
Number of nonisomorphic binary n-state automata.
- Number of nonisomorphic connected binary n-state automata.A054051
Number of nonisomorphic connected binary n-state automata.
- Number of nonisomorphic n-state automata with binary inputs and outputs.A054052
Number of nonisomorphic n-state automata with binary inputs and outputs.
- Number of nonisomorphic connected n-state automata with binary inputs and outputs.A054053
Number of nonisomorphic connected n-state automata with binary inputs and outputs.
- Smallest digit of n.A054054
Smallest digit of n.
- Largest digit of n.A054055
Largest digit of n.
- Numbers of form 29+n^2+n or 29+2*n^2.A054056
Numbers of form 29+n^2+n or 29+2*n^2.
- Numbers of form 41+n^2+n or 41+2*n^2.A054057
Numbers of form 41+n^2+n or 41+2*n^2.
- Inverse Moebius transform of A000031 (starting at term 0).A054058
Inverse Moebius transform of A000031 (starting at term 0).
- Least k for which the integers Floor(k*arctan(m)) for m=1,2,...,n are distinct.A054059
Least k for which the integers Floor(k*arctan(m)) for m=1,2,...,n are distinct.
- Least k for which the integers floor(k*(Pi/2 - arctan(m))) for m=1,2,...,n are distinct.A054060
Least k for which the integers floor(k*(Pi/2 - arctan(m))) for m=1,2,...,n are distinct.