Sequences
392,541 sequences
- a(n) is the smallest triangular number divisible by n.A066561
a(n) is the smallest triangular number divisible by n.
- Smallest Bell number (A000110) divisible by n, if such a number exists, otherwise 0.A066562
Smallest Bell number (A000110) divisible by n, if such a number exists, otherwise 0.
- Smallest Catalan number (A000108) divisible by n.A066563
Smallest Catalan number (A000108) divisible by n.
- Numbers that when incremented by the sum of their digits produce a square.A066564
Numbers that when incremented by the sum of their digits produce a square.
- Numbers that when multiplied by the product of their nonzero digits produce a square.A066565
Numbers that when multiplied by the product of their nonzero digits produce a square.
- Numbers that when decremented by the sum of their digits produce a square.A066566
Numbers that when decremented by the sum of their digits produce a square.
- Numbers that when incremented by the product of their digits produce a square.A066567
Numbers that when incremented by the product of their digits produce a square.
- a(n) = n - sum of digits of n.A066568
a(n) = n - sum of digits of n.
- Triangular numbers whose reverse is also triangular.A066569
Triangular numbers whose reverse is also triangular.
- Product of numbers <= n that have a prime factor in common with n.A066570
Product of numbers <= n that have a prime factor in common with n.
- Number of sets of positive integers with arithmetic mean n.A066571
Number of sets of positive integers with arithmetic mean n.
- Number of sets of distinct positive integers with geometric mean n.A066572
Number of sets of distinct positive integers with geometric mean n.
- Pairs (x, y), x < y, of f-amicable numbers where f(k) = floor(|k*sin(k)|) sorted by increasing y, then increasing x; f-amicable numbers are defined in A066511.A066573
Pairs (x, y), x < y, of f-amicable numbers where f(k) = floor(|k*sin(k)|) sorted by increasing y, then increasing x; f-amicable numbers are defined in A066511.
- LCM of numbers <= n and having a factor in common with n.A066574
LCM of numbers <= n and having a factor in common with n.
- LCM of numbers m such that 1 <= m <= n, m has a common factor with n, but m does not divide n.A066575
LCM of numbers m such that 1 <= m <= n, m has a common factor with n, but m does not divide n.
- Composite Euclid numbers: numbers of the form p# + 1, where p# denotes the primorial of the prime p.A066576
Composite Euclid numbers: numbers of the form p# + 1, where p# denotes the primorial of the prime p.
- a(n) = floor(n/(product of nonzero digits of n)).A066577
a(n) = floor(n/(product of nonzero digits of n)).
- a(n) = floor(n/(sum of digits of n)).A066578
a(n) = floor(n/(sum of digits of n)).
- Erroneous version of A113315.A066579
Erroneous version of A113315.
- Let N = 123456789123456789123456789..., with the digits from 1 to 9 repeated indefinitely. Then a(n) is the n-digit number formed from the digits starting at the {n(n-1)/2 +1}-th position of N, read backwards if n is even.A066580
Let N = 123456789123456789123456789..., with the digits from 1 to 9 repeated indefinitely. Then a(n) is the n-digit number formed from the digits starting at the {n(n-1)/2 +1}-th position of N, read backwards if n is even.
- Product of nonzero digits of A066547(n).A066581
Product of nonzero digits of A066547(n).
- Product of nonzero digits of A066549(n).A066582
Product of nonzero digits of A066549(n).
- Product of nonzero digits of A066551(n).A066583
Product of nonzero digits of A066551(n).
- Product of nonzero digits of A066553(n).A066584
Product of nonzero digits of A066553(n).
- Product of nonzero digits of A066555(n).A066585
Product of nonzero digits of A066555(n).
- Number of normal subgroups of the group of n X n signed permutations matrices (described in sequence A066051).A066586
Number of normal subgroups of the group of n X n signed permutations matrices (described in sequence A066051).
- Duplicate of A047621.A066587
Duplicate of A047621.
- a(n) = sum of the digits of n^n.A066588
a(n) = sum of the digits of n^n.
- Let u_n be the group of units mod n (invertible elements in the ring Z_n); a(n) is the number of cyclic subgroups in u_n.A066589
Let u_n be the group of units mod n (invertible elements in the ring Z_n); a(n) is the number of cyclic subgroups in u_n.
- Numbers which can be expressed as product of a number and its reversal in at least three different ways.A066590
Numbers which can be expressed as product of a number and its reversal in at least three different ways.
- Primes which can be expressed as a concatenation of nonnegative squares.A066591
Primes which can be expressed as a concatenation of nonnegative squares.
- Primes which can be expressed as concatenation of cubes.A066592
Primes which can be expressed as concatenation of cubes.
- Primes which can be expressed as concatenation of powers of 2 and 0's.A066593
Primes which can be expressed as concatenation of powers of 2 and 0's.
- Primes which can be expressed as concatenation of powers of 3 and 0's.A066594
Primes which can be expressed as concatenation of powers of 3 and 0's.
- Primes which can be expressed as concatenation of powers of 4 and 0's.A066595
Primes which can be expressed as concatenation of powers of 4 and 0's.
- Primes which can be expressed as concatenation of powers of 5 and 0's.A066596
Primes which can be expressed as concatenation of powers of 5 and 0's.
- Primes which can be expressed as concatenation of powers of 6 and 0's.A066597
Primes which can be expressed as concatenation of powers of 6 and 0's.
- Numbers which can be expressed as the product of a number and its reversal in four different ways.A066598
Numbers which can be expressed as the product of a number and its reversal in four different ways.
- a(n) = smallest number which can be expressed as the product of a number and its reversal in exactly n different ways.A066599
a(n) = smallest number which can be expressed as the product of a number and its reversal in exactly n different ways.
- Sum of the digits in the n-th row of Pascal's triangle.A066600
Sum of the digits in the n-th row of Pascal's triangle.
- a(n) = 3^n mod n.A066601
a(n) = 3^n mod n.
- a(n) = 4^n mod n.A066602
a(n) = 4^n mod n.
- a(n) = 5^n mod n.A066603
a(n) = 5^n mod n.
- a(n) = 6^n mod n.A066604
a(n) = 6^n mod n.
- Numbers k such that phi(k)/lambda(k) increases to a record value, where phi(k) is the Euler totient function (A000010) and lambda(k) is the Carmichael lambda function (A002322).A066605
Numbers k such that phi(k)/lambda(k) increases to a record value, where phi(k) is the Euler totient function (A000010) and lambda(k) is the Carmichael lambda function (A002322).
- a(n) = 2^n mod n^2.A066606
a(n) = 2^n mod n^2.
- a(n) = 3^n mod n^3.A066607
a(n) = 3^n mod n^3.
- a(n) = 4^n mod n^4.A066608
a(n) = 4^n mod n^4.
- a(n) = 5^n mod n^5.A066609
a(n) = 5^n mod n^5.
- a(n) = 6^n mod n^6.A066610
a(n) = 6^n mod n^6.