Sequences
392,541 sequences
- A permutation of the natural numbers.A067061
A permutation of the natural numbers.
- Numbers k such that sigma(k+2) - sigma(k) = prime(k+1) - prime(k).A067062
Numbers k such that sigma(k+2) - sigma(k) = prime(k+1) - prime(k).
- Smallest prime factor of repunit(n) = (10^n-1)/9 (A002275).A067063
Smallest prime factor of repunit(n) = (10^n-1)/9 (A002275).
- Numbers k such that sigma(sigma(sigma(k))) == 0 (mod sigma(k)).A067064
Numbers k such that sigma(sigma(sigma(k))) == 0 (mod sigma(k)).
- Numbers k such that sigma(sigma(sigma(k))) == 6*sigma(k).A067065
Numbers k such that sigma(sigma(sigma(k))) == 6*sigma(k).
- Number of Gnutella users reachable with given connections and hops.A067066
Number of Gnutella users reachable with given connections and hops.
- a(n) = product of nonzero digits of n! (A000142).A067067
a(n) = product of nonzero digits of n! (A000142).
- a(n) = n* - 2^n, where n* (A003418) = least common multiple of the numbers [1,...,n].A067068
a(n) = n* - 2^n, where n* (A003418) = least common multiple of the numbers [1,...,n].
- Numbers n such that for every k the following condition holds: (*) The number of nonnegative solutions of the Diophantine equation x^2 + n*y^2 = 1+n*k^2 equals one half of the number of divisors of 1+n*k^2 if 1+n*k^2 is not a square and one half of 1 + the number of divisors of 1+n*k^2 if 1+n*k^2 is a square.A067069
Numbers n such that for every k the following condition holds: (*) The number of nonnegative solutions of the Diophantine equation x^2 + n*y^2 = 1+n*k^2 equals one half of the number of divisors of 1+n*k^2 if 1+n*k^2 is not a square and one half of 1 + the number of divisors of 1+n*k^2 if 1+n*k^2 is a square.
- Cubes whose product of digits is a cube > 0.A067070
Cubes whose product of digits is a cube > 0.
- Numbers with no zeros in their cubes such that the products of the digits of their cubes are also cubes.A067071
Numbers with no zeros in their cubes such that the products of the digits of their cubes are also cubes.
- a(n) = smallest square m^2 such that the sum of the digits of m^2 is equal to n^2.A067072
a(n) = smallest square m^2 such that the sum of the digits of m^2 is equal to n^2.
- Records in A092419.A067073
Records in A092419.
- a(n) = smallest cube m^3 such that the sum of the digits of m^3 is equal to n^3.A067074
a(n) = smallest cube m^3 such that the sum of the digits of m^3 is equal to n^3.
- a(n) is the smallest number m such that the sum of the digits of m^3 is equal to n^3.A067075
a(n) is the smallest number m such that the sum of the digits of m^3 is equal to n^3.
- Numbers k such that 2*k + 3 is a prime.A067076
Numbers k such that 2*k + 3 is a prime.
- Numbers whose product of distinct prime factors is equal to its sum of digits.A067077
Numbers whose product of distinct prime factors is equal to its sum of digits.
- a(1) = 1, a(2) = 2, a(n) = (n-1)*a(n-1) - (n-2)*a(n-2).A067078
a(1) = 1, a(2) = 2, a(n) = (n-1)*a(n-1) - (n-2)*a(n-2).
- Right digitorial function Rd(n) = abcd...*bcd...*cd...*d...*..., for n = abcd... in decimal notation.A067079
Right digitorial function Rd(n) = abcd...*bcd...*cd...*d...*..., for n = abcd... in decimal notation.
- If n = ab...def in decimal notation then the left digitorial function Ld(n) = ab...def*ab...de*ab...d*...*ab*a.A067080
If n = ab...def in decimal notation then the left digitorial function Ld(n) = ab...def*ab...de*ab...d*...*ab*a.
- Numbers k such that sigma(k+1) = 2*sigma(k).A067081
Numbers k such that sigma(k+1) = 2*sigma(k).
- If n = abc...def in decimal notation then the right digit sum function = abc...def + bc...def + c...def + ... + def + ef + f.A067082
If n = abc...def in decimal notation then the right digit sum function = abc...def + bc...def + c...def + ... + def + ef + f.
- Number of digits in n^(n^(n-1)).A067083
Number of digits in n^(n^(n-1)).
- Number of digits in n^{(n-1)!}.A067084
Number of digits in n^{(n-1)!}.
- a(n) = floor(Sum_{k=1..n} 1/k^(1/2)).A067085
a(n) = floor(Sum_{k=1..n} 1/k^(1/2)).
- a(n) = floor(Sum_{k=1..n} 1/k^(1/3)).A067086
a(n) = floor(Sum_{k=1..n} 1/k^(1/3)).
- Concatenation of n-th prime and its reverse.A067087
Concatenation of n-th prime and its reverse.
- Floor(X/Y) where X = concatenation of (n+1), (n+2), ...up to 2n and Y = concatenation of 1,2,3,4,... up to n.A067088
Floor(X/Y) where X = concatenation of (n+1), (n+2), ...up to 2n and Y = concatenation of 1,2,3,4,... up to n.
- Floor(X/Y) where X = concatenation of (2n), (2n-1), ... down to n+1 and Y = concatenation of n, n-1, n-2, ... down to 1.A067089
Floor(X/Y) where X = concatenation of (2n), (2n-1), ... down to n+1 and Y = concatenation of n, n-1, n-2, ... down to 1.
- Floor(X/Y) where X = concatenation of (2n), (2n-1), ... down to n+1 and Y = concatenation of 1,2,3,... up to n.A067090
Floor(X/Y) where X = concatenation of (2n), (2n-1), ... down to n+1 and Y = concatenation of 1,2,3,... up to n.
- Floor(X/Y) where X = concatenation of the (n+1)-st even number through the (2n)-th even number and Y = concatenation of first n even numbers.A067091
Floor(X/Y) where X = concatenation of the (n+1)-st even number through the (2n)-th even number and Y = concatenation of first n even numbers.
- a(n) = floor(X/Y) where X = concatenation in decreasing order of (2n)-th even number to (n+1)-th even number and Y = that of first n even numbers in increasing order.A067092
a(n) = floor(X/Y) where X = concatenation in decreasing order of (2n)-th even number to (n+1)-th even number and Y = that of first n even numbers in increasing order.
- Floor[X/Y] where X = concatenation of (n+1)-st odd number through the 2n-th odd number and Y = concatenation of first n odd numbers.A067093
Floor[X/Y] where X = concatenation of (n+1)-st odd number through the 2n-th odd number and Y = concatenation of first n odd numbers.
- Floor[X/Y] where X = concatenation in decreasing order of (n+1)-st odd number through the 2n-th odd number and Y = concatenation in increasing order of first n odd numbers.A067094
Floor[X/Y] where X = concatenation in decreasing order of (n+1)-st odd number through the 2n-th odd number and Y = concatenation in increasing order of first n odd numbers.
- a(n) = floor(X/Y) where X is the concatenation in increasing order of the first n even numbers and Y is that of the first n odd numbers.A067095
a(n) = floor(X/Y) where X is the concatenation in increasing order of the first n even numbers and Y is that of the first n odd numbers.
- Floor[X/Y] where X = concatenation in increasing order of first n even numbers and Y = that of first n natural numbers.A067096
Floor[X/Y] where X = concatenation in increasing order of first n even numbers and Y = that of first n natural numbers.
- Floor[X/Y] where X = concatenation in increasing order of first n powers of 2 and Y = that of first n natural numbers.A067097
Floor[X/Y] where X = concatenation in increasing order of first n powers of 2 and Y = that of first n natural numbers.
- Floor[X/Y] where X = concatenation in increasing order of first n powers of 3 and Y = that of first n natural numbers.A067098
Floor[X/Y] where X = concatenation in increasing order of first n powers of 3 and Y = that of first n natural numbers.
- Floor[radius of the circumscribed circle of a regular n-gon with unit sides].A067099
Floor[radius of the circumscribed circle of a regular n-gon with unit sides].
- Floor[radius of the inscribed-circle of a regular n-gon with unit sides].A067100
Floor[radius of the inscribed-circle of a regular n-gon with unit sides].
- Floor[ X/Y], where X = concatenation of the primes and Y = concatenation of natural numbers.A067101
Floor[ X/Y], where X = concatenation of the primes and Y = concatenation of natural numbers.
- Floor[ X/Y] where X = concatenation of the squares and Y = concatenation of natural numbers.A067102
Floor[ X/Y] where X = concatenation of the squares and Y = concatenation of natural numbers.
- a(n) = floor(X/Y), where X = concatenation of cubes and Y = concatenation of natural numbers.A067103
a(n) = floor(X/Y), where X = concatenation of cubes and Y = concatenation of natural numbers.
- a(n) = floor[ X/Y], where X = concatenation of first n factorials and Y = concatenation of first n natural numbers.A067104
a(n) = floor[ X/Y], where X = concatenation of first n factorials and Y = concatenation of first n natural numbers.
- a(n) = floor[ X/Y], where X = concatenation of k^k from 1 up to n^n and Y = concatenation of 1, ..., n.A067105
a(n) = floor[ X/Y], where X = concatenation of k^k from 1 up to n^n and Y = concatenation of 1, ..., n.
- a(n) = smallest number whose digit product equals n!/m where m is the product of all prime factors > 7 of n! (with multiplicity).A067106
a(n) = smallest number whose digit product equals n!/m where m is the product of all prime factors > 7 of n! (with multiplicity).
- Smallest number whose sum of digits is n!.A067107
Smallest number whose sum of digits is n!.
- a(n) = a number with 2n digits with first n digits odd and the rest even, in cyclic increasing order.A067108
a(n) = a number with 2n digits with first n digits odd and the rest even, in cyclic increasing order.
- Number of occurrences of the string n in n! (A000142).A067109
Number of occurrences of the string n in n! (A000142).
- a(n) = floor(concatenation of first n primes / sum of first n primes).A067110
a(n) = floor(concatenation of first n primes / sum of first n primes).