Sequences
392,541 sequences
- Numbers k such that the largest prime factor of k is equal to the sum of primes dividing k+1 (with repetition).A071861
Numbers k such that the largest prime factor of k is equal to the sum of primes dividing k+1 (with repetition).
- Number of elements in the continued fraction for Sum_{d|n} 1/d.A071862
Number of elements in the continued fraction for Sum_{d|n} 1/d.
- Numbers n such that sum of primes dividing n (with repetition) is equal to the largest prime factor of n+1.A071863
Numbers n such that sum of primes dividing n (with repetition) is equal to the largest prime factor of n+1.
- Nonprime n such that the number of elements in the continued fraction for Sum_{d|n} 1/d equals tau(n), the number of divisors of n.A071864
Nonprime n such that the number of elements in the continued fraction for Sum_{d|n} 1/d equals tau(n), the number of divisors of n.
- Smallest k such that the simple continued fraction for Sum(d|k, 1/d) contains exactly n elements.A071865
Smallest k such that the simple continued fraction for Sum(d|k, 1/d) contains exactly n elements.
- Number of elements in the continued fraction for prime(n+1)/prime(n).A071866
Number of elements in the continued fraction for prime(n+1)/prime(n).
- Maximum element in the continued fraction for prime(n+1)/prime(n).A071867
Maximum element in the continued fraction for prime(n+1)/prime(n).
- Number of integers k (1 <= k <= n) such that k^2+1 is prime.A071868
Number of integers k (1 <= k <= n) such that k^2+1 is prime.
- Numbers k such that gpf(k) < gpf(k+1) < gpf(k+2) where gpf(k) denotes the largest prime factor of k.A071869
Numbers k such that gpf(k) < gpf(k+1) < gpf(k+2) where gpf(k) denotes the largest prime factor of k.
- Numbers k such that gpf(k) > gpf(k+1) > gpf(k+2) where gpf(k) denotes the largest prime factor of k.A071870
Numbers k such that gpf(k) > gpf(k+1) > gpf(k+2) where gpf(k) denotes the largest prime factor of k.
- Duplicate of A055030.A071871
Duplicate of A055030.
- Number of positive k such that k*tau(k) < n plus the number of positive k such that k*tau(k) = n-1.A071872
Number of positive k such that k*tau(k) < n plus the number of positive k such that k*tau(k) = n-1.
- Decimal expansion of the sixth (of 10) decimal selvage number; the n-th digit of a decimal selvage number, x, is equal to the tenths digit of n*x.A071873
Decimal expansion of the sixth (of 10) decimal selvage number; the n-th digit of a decimal selvage number, x, is equal to the tenths digit of n*x.
- Decimal expansion of the seventh (of 10) decimal selvage number; the n-th digit of a decimal selvage number, x, is equal to the tenths digit of n*x.A071874
Decimal expansion of the seventh (of 10) decimal selvage number; the n-th digit of a decimal selvage number, x, is equal to the tenths digit of n*x.
- Decimal expansion of the eighth (of 10) decimal selvage number; the n-th digit of a decimal selvage number, x, is equal to the tenths digit of n*x.A071875
Decimal expansion of the eighth (of 10) decimal selvage number; the n-th digit of a decimal selvage number, x, is equal to the tenths digit of n*x.
- Decimal expansion of the ninth (of 10) decimal selvage number; the n-th digit of a decimal selvage number, x, is equal to the tenths digit of n*x.A071876
Decimal expansion of the ninth (of 10) decimal selvage number; the n-th digit of a decimal selvage number, x, is equal to the tenths digit of n*x.
- Decimal expansion of the tenth (of 10) decimal selvage number; the n-th digit of a decimal selvage number, x, is equal to the tenths digit of n*x.A071877
Decimal expansion of the tenth (of 10) decimal selvage number; the n-th digit of a decimal selvage number, x, is equal to the tenths digit of n*x.
- G.f. D(x) satisfies: D(x) = (1 + x*D(x))*(1 + 2*x*D(x))*(1 + 3*x*D(x)).A071878
G.f. D(x) satisfies: D(x) = (1 + x*D(x))*(1 + 2*x*D(x))*(1 + 3*x*D(x)).
- G.f. satisfies: A(x) = 1 + x*A(x) + x^3*A(x)^3.A071879
G.f. satisfies: A(x) = 1 + x*A(x) + x^3*A(x)^3.
- Number of combinatorial types of n-dimensional parallelohedra.A071880
Number of combinatorial types of n-dimensional parallelohedra.
- Number of different primitive polyhedral types of Voronoi regions of n-dimensional point lattices.A071881
Number of different primitive polyhedral types of Voronoi regions of n-dimensional point lattices.
- Number of contraction types of n-dimensional parallelohedra.A071882
Number of contraction types of n-dimensional parallelohedra.
- A002487(n)*A002487(n+2).A071883
A002487(n)*A002487(n+2).
- Trajectory of 37 under map x -> A002487(x)*A002487(x+1).A071884
Trajectory of 37 under map x -> A002487(x)*A002487(x+1).
- Trajectory of 38 under map x -> A002487(x)*A002487(x+1).A071885
Trajectory of 38 under map x -> A002487(x)*A002487(x+1).
- Trajectory of 41 under map x -> A002487(x)*A002487(x+1).A071886
Trajectory of 41 under map x -> A002487(x)*A002487(x+1).
- Conjectured values of n whose trajectory under map x -> A002487(x)*A002487(x+1) does not go into a cycle.A071887
Conjectured values of n whose trajectory under map x -> A002487(x)*A002487(x+1) does not go into a cycle.
- a(1)=2 and for n>1 a(n) = least squarefree m > n with gcd(m,n)>1.A071888
a(1)=2 and for n>1 a(n) = least squarefree m > n with gcd(m,n)>1.
- a(n) = gcd(A071888(n), n).A071889
a(n) = gcd(A071888(n), n).
- a(n) = A071888(n)-n.A071890
a(n) = A071888(n)-n.
- A071890(n)/A071889(n).A071891
A071890(n)/A071889(n).
- a(n) = lcm(A071888(n), n).A071892
a(n) = lcm(A071888(n), n).
- a(n) = Min_{k | A071891(k) = n}.A071893
a(n) = Min_{k | A071891(k) = n}.
- Largest positive primitive root (<p) of n-th prime p.A071894
Largest positive primitive root (<p) of n-th prime p.
- CONTINUANT transform of Fibonacci number 1, 2, 3, 5, 8, ...A071895
CONTINUANT transform of Fibonacci number 1, 2, 3, 5, 8, ...
- CONTINUANT transform of triangular numbers 1, 3, 6, 10, ...A071896
CONTINUANT transform of triangular numbers 1, 3, 6, 10, ...
- CONTINUANT transform of Catalan numbers 1, 2, 5, 14, 42, ...A071897
CONTINUANT transform of Catalan numbers 1, 2, 5, 14, 42, ...
- CONTINUANT transform of A002487: 1, 1, 2, 1, 3, 2, ...A071898
CONTINUANT transform of A002487: 1, 1, 2, 1, 3, 2, ...
- a(0)=1 and for n>0: a(n) = least prime>a(n-1) of form 1+k*n.A071899
a(0)=1 and for n>0: a(n) = least prime>a(n-1) of form 1+k*n.
- 1/4 times the number of n X n 0..7 matrices with MM' mod 8 = I, where M' is the transpose of M and I is the n X n identity matrix.A071900
1/4 times the number of n X n 0..7 matrices with MM' mod 8 = I, where M' is the transpose of M and I is the n X n identity matrix.
- n-th decimal digit of the fractional part of the square root of the n-th prime.A071901
n-th decimal digit of the fractional part of the square root of the n-th prime.
- Sum_{k=0..n^2} (k^2 - n^2)/n.A071902
Sum_{k=0..n^2} (k^2 - n^2)/n.
- Number of x less than or equal to n and divisible only by primes congruent to 3 mod 4 (i.e., in A004614).A071903
Number of x less than or equal to n and divisible only by primes congruent to 3 mod 4 (i.e., in A004614).
- Odd composite numbers.A071904
Odd composite numbers.
- a(n) is the smallest positive integer (which is a polynomial of degree 0) that cannot be obtained using the polynomials {x, x+1, ..., x+n} using each polynomial at most once and the operations +, -, *, /.A071905
a(n) is the smallest positive integer (which is a polynomial of degree 0) that cannot be obtained using the polynomials {x, x+1, ..., x+n} using each polynomial at most once and the operations +, -, *, /.
- Sum of digits of 2^n (mod 2).A071906
Sum of digits of 2^n (mod 2).
- Kolakoski-(1,4) sequence: a(n) is length of n-th run.A071907
Kolakoski-(1,4) sequence: a(n) is length of n-th run.
- A002487(n)*A002487(n+1)*A002487(n+2).A071908
A002487(n)*A002487(n+1)*A002487(n+2).
- A002487(n)*A002487(n+1)*A002487(n+2)/2.A071909
A002487(n)*A002487(n+1)*A002487(n+2)/2.
- a(n) = t(n)*t(n+1)*t(n+2), where t() are the triangular numbers.A071910
a(n) = t(n)*t(n+1)*t(n+2), where t() are the triangular numbers.