Sequences
392,541 sequences
- Numbers of pairs (i, j), i, j > 1, such that i^j <= n.A089361
Numbers of pairs (i, j), i, j > 1, such that i^j <= n.
- Numbers n such that n^2 - 5n + 5 is prime.A089362
Numbers n such that n^2 - 5n + 5 is prime.
- Numbers of pairs (i, j), i, j > 1, such that i^j <= 10^n.A089363
Numbers of pairs (i, j), i, j > 1, such that i^j <= 10^n.
- Smallest prime whose product of digits is an n-th power.A089364
Smallest prime whose product of digits is an n-th power.
- Smallest prime whose product of digits is 2^n.A089365
Smallest prime whose product of digits is 2^n.
- Smallest prime whose digital product is >= n.A089366
Smallest prime whose digital product is >= n.
- Smallest prime p such that np +1 is a prime, or 0 if no such prime exists.A089367
Smallest prime p such that np +1 is a prime, or 0 if no such prime exists.
- Least k such that 2*pi(n) = pi(n+k), where pi(n) = number of primes up to n. (The number of primes between 1 to n is the same as the number of primes between n+1 and n+k.)A089368
Least k such that 2*pi(n) = pi(n+k), where pi(n) = number of primes up to n. (The number of primes between 1 to n is the same as the number of primes between n+1 and n+k.)
- Begin with n and place (n-1) on the least significant side, place (n-2) on the most significant side and so on until a 1 is placed.A089369
Begin with n and place (n-1) on the least significant side, place (n-2) on the most significant side and so on until a 1 is placed.
- Begin with n and place (n-1) on the most significant side, place (n-2) on the least significant side and so on until a 1 is placed.A089370
Begin with n and place (n-1) on the most significant side, place (n-2) on the least significant side and so on until a 1 is placed.
- Number of divisors of n that do not exceed the abundance of n.A089371
Number of divisors of n that do not exceed the abundance of n.
- Number of Motzkin paths of length n with no peaks at level 1.A089372
Number of Motzkin paths of length n with no peaks at level 1.
- Numbers k such that k^2 - 7*k + 7 is prime.A089373
Numbers k such that k^2 - 7*k + 7 is prime.
- Numbers n such that the concatenation (in descending order) of all the divisors of n, with 1 in the least significant position, is prime (or 1).A089374
Numbers n such that the concatenation (in descending order) of all the divisors of n, with 1 in the least significant position, is prime (or 1).
- Duplicate of A069582.A089375
Duplicate of A069582.
- Primes of the form k^2 - 7*k + 7.A089376
Primes of the form k^2 - 7*k + 7.
- Numbers whose product of digits +1 and -1 gives twin prime pairs.A089377
Numbers whose product of digits +1 and -1 gives twin prime pairs.
- Number of one-step transitions between all unlabeled hierarchies of n elements.A089378
Number of one-step transitions between all unlabeled hierarchies of n elements.
- Numbers k such that 10^k + k is prime.A089379
Numbers k such that 10^k + k is prime.
- Number of Motzkin paths of length n with no UD, UHD, UHHD, UHHHD, ..., starting at level zero (here H=(1,0), U=(1,1), D=(1,-1)).A089380
Number of Motzkin paths of length n with no UD, UHD, UHHD, UHHHD, ..., starting at level zero (here H=(1,0), U=(1,1), D=(1,-1)).
- L-th order palindromes with L > 2.A089381
L-th order palindromes with L > 2.
- Total number of triangles in all the dissections of a convex (n+3)-gon by nonintersecting diagonals.A089382
Total number of triangles in all the dissections of a convex (n+3)-gon by nonintersecting diagonals.
- Number of peaks at even level in all Schroeder paths (i.e., consisting of steps U=(1,1), D=(1,-1), H=(2,0) and never going below the axis) from (0,0) to (2n+4,0).A089383
Number of peaks at even level in all Schroeder paths (i.e., consisting of steps U=(1,1), D=(1,-1), H=(2,0) and never going below the axis) from (0,0) to (2n+4,0).
- Greatest squarefree proper divisor of n, a(1) = 1.A089384
Greatest squarefree proper divisor of n, a(1) = 1.
- Expansion of Product_{k>0} (1 + x^k) * (1 - x^(2*k)) / (1 + x^(4*k)) in powers of x.A089385
Expansion of Product_{k>0} (1 + x^k) * (1 - x^(2*k)) / (1 + x^(4*k)) in powers of x.
- Smallest number with digital product = 10^n.A089386
Smallest number with digital product = 10^n.
- Number of Schroeder paths of semilength n (i.e., lattice paths from (0,0) to (2n,0), with steps H=(2,0), U=(1,1) and D(1,-1) and not going below the x-axis) with no UD, UHD, UHHD, UHHHD, ... starting at level zero.A089387
Number of Schroeder paths of semilength n (i.e., lattice paths from (0,0) to (2n,0), with steps H=(2,0), U=(1,1) and D(1,-1) and not going below the x-axis) with no UD, UHD, UHHD, UHHHD, ... starting at level zero.
- Duplicate of A055494.A089388
Duplicate of A055494.
- Sum of the smallest and the largest nontrivial divisor of n or 0 if n is 1 or a prime.A089389
Sum of the smallest and the largest nontrivial divisor of n or 0 if n is 1 or a prime.
- For n > 1, a(n) is the least composite number not already used such that the n-th partial sum is prime.A089390
For n > 1, a(n) is the least composite number not already used such that the n-th partial sum is prime.
- Primes arising in A089390 as the n-th partial sum.A089391
Primes arising in A089390 as the n-th partial sum.
- Magnanimous primes: primes with the property that inserting a "+" in any place between two digits yields a sum which is prime.A089392
Magnanimous primes: primes with the property that inserting a "+" in any place between two digits yields a sum which is prime.
- Smallest n-digit magnanimous prime (A089392), or 0 if there is no such prime with n digits.A089393
Smallest n-digit magnanimous prime (A089392), or 0 if there is no such prime with n digits.
- Largest n-digit member of A089392, or 0 if there is no such n-digit term.A089394
Largest n-digit member of A089392, or 0 if there is no such n-digit term.
- Prime productive numbers m: Let the digits of m be abcd. Then the numbers bcd*a+1, cd*ab+1, d*abc+1, abcd+1 etc. are all primes. If m is a k-digit number it produces k such primes.A089395
Prime productive numbers m: Let the digits of m be abcd. Then the numbers bcd*a+1, cd*ab+1, d*abc+1, abcd+1 etc. are all primes. If m is a k-digit number it produces k such primes.
- Smallest n-digit term of A089395.A089396
Smallest n-digit term of A089395.
- Largest n-digit member of A089395.A089397
Largest n-digit member of A089395.
- a(n) = n-th column sum of binary digits of k*2^(k-1), where summation is over k>=1, without carrying between columns.A089398
a(n) = n-th column sum of binary digits of k*2^(k-1), where summation is over k>=1, without carrying between columns.
- a(n) satisfies: 2^a(n)+1 = sum(k=1,n, A089398(k)*2^(k-1)) for n>2, with a(1)=a(2)=0.A089399
a(n) satisfies: 2^a(n)+1 = sum(k=1,n, A089398(k)*2^(k-1)) for n>2, with a(1)=a(2)=0.
- a(n) = m - A089398(2^m - n) for m>=n.A089400
a(n) = m - A089398(2^m - n) for m>=n.
- a(n) = m - A089398(2^m + n) for m>=n.A089401
a(n) = m - A089398(2^m + n) for m>=n.
- Number of cycles in range [A014137(n-1)..A014138(n-1)] of permutation A089864.A089402
Number of cycles in range [A014137(n-1)..A014138(n-1)] of permutation A089864.
- Least common multiple of all cycle sizes in range [A014137(n-1)..A014138(n-1)] of permutation A071661/A071662.A089403
Least common multiple of all cycle sizes in range [A014137(n-1)..A014138(n-1)] of permutation A071661/A071662.
- Number of cycles in range [A014137(n-1)..A014138(n-1)] of permutation A073286/A073287.A089404
Number of cycles in range [A014137(n-1)..A014138(n-1)] of permutation A073286/A073287.
- Number of cycles in range [A014137(n-1)..A014138(n-1)] of permutation A073288/A073289.A089405
Number of cycles in range [A014137(n-1)..A014138(n-1)] of permutation A073288/A073289.
- Number of cycles in range [A014137(n-1)..A014138(n-1)] of permutation A082345/A082346.A089406
Number of cycles in range [A014137(n-1)..A014138(n-1)] of permutation A082345/A082346.
- Number of cycles in range [A014137(n-1)..A014138(n-1)] of permutation A089859/A089863.A089407
Number of cycles in range [A014137(n-1)..A014138(n-1)] of permutation A089859/A089863.
- Number of fixed points in range [A014137(n-1)..A014138(n-1)] of permutation A089864.A089408
Number of fixed points in range [A014137(n-1)..A014138(n-1)] of permutation A089864.
- Even-indexed terms of A089413.A089409
Even-indexed terms of A089413.
- Least common multiple of all cycle sizes (also the maximum cycle size) in range [A014137(n-1)..A014138(n-1)] of permutation A074679/A074680.A089410
Least common multiple of all cycle sizes (also the maximum cycle size) in range [A014137(n-1)..A014138(n-1)] of permutation A074679/A074680.