Sequences
392,541 sequences
- a(n) = floor(composite(n)^(composite(n)/n)), composite(n) = A002808(n).A093861
a(n) = floor(composite(n)^(composite(n)/n)), composite(n) = A002808(n).
- Floor[ prime(n)^{prime(n)/n}], prime(n) = A000040(n).A093862
Floor[ prime(n)^{prime(n)/n}], prime(n) = A000040(n).
- Unitary sigma-unitary phi super perfect numbers: USUP(USUP(n))= n/k for some integer k.A093863
Unitary sigma-unitary phi super perfect numbers: USUP(USUP(n))= n/k for some integer k.
- Consider the least k such that prime(k) > n*composite(k). Sequence gives prime(k).A093864
Consider the least k such that prime(k) > n*composite(k). Sequence gives prime(k).
- a(1) = 2, a(n) = least prime > a(n-1)^n.A093865
a(1) = 2, a(n) = least prime > a(n-1)^n.
- a(0)=1, then a(n) is the least number such that there are exactly n numbers coprime to a(n-1) between a(n-1) and a(n) (excluded).A093866
a(0)=1, then a(n) is the least number such that there are exactly n numbers coprime to a(n-1) between a(n-1) and a(n) (excluded).
- Duplicate of A069549.A093867
Duplicate of A069549.
- Smallest prime that differs from a multiple of n by unity.A093868
Smallest prime that differs from a multiple of n by unity.
- Frequency of occurrence of prime(n) in A093868.A093869
Frequency of occurrence of prime(n) in A093868.
- Triangle read by rows: T(n,k) is the k-th prime = -1 (mod n), 1 <= k <= n.A093870
Triangle read by rows: T(n,k) is the k-th prime = -1 (mod n), 1 <= k <= n.
- a(n) is the n-th prime = -1 (mod n).A093871
a(n) is the n-th prime = -1 (mod n).
- Least composite number with sum of the prime divisors = n, or zero if no such number exists.A093872
Least composite number with sum of the prime divisors = n, or zero if no such number exists.
- Numerators in Kepler's tree of harmonic fractions.A093873
Numerators in Kepler's tree of harmonic fractions.
- Least k such that there are at least n primes between k and k^2.A093874
Least k such that there are at least n primes between k and k^2.
- Denominators in Kepler's tree of harmonic fractions.A093875
Denominators in Kepler's tree of harmonic fractions.
- Continued fraction expansion of fourth root of 9.1.A093876
Continued fraction expansion of fourth root of 9.1.
- Number of fixed n-celled polyzebras (or zebra-move-connected polyominoes).A093877
Number of fixed n-celled polyzebras (or zebra-move-connected polyominoes).
- a(1)=a(2)=1; for n >=3, a(n) = a(a(a(n-1))) + a(n-a(a(n-1))).A093878
a(1)=a(2)=1; for n >=3, a(n) = a(a(a(n-1))) + a(n-a(a(n-1))).
- First differences of A004001.A093879
First differences of A004001.
- a(n) = lcm(1, 2, ..., 2n) / lcm(1, 2, ..., n).A093880
a(n) = lcm(1, 2, ..., 2n) / lcm(1, 2, ..., n).
- Let n! = 2^a*3^b*5^c*7^d.... in canonical form, then a(n) = concatenation a,b,c,d,...A093881
Let n! = 2^a*3^b*5^c*7^d.... in canonical form, then a(n) = concatenation a,b,c,d,...
- Sum of all the numbers formed by deleting one digit from n.A093882
Sum of all the numbers formed by deleting one digit from n.
- Product of all possible sums of two distinct numbers taken from among first n natural numbers.A093883
Product of all possible sums of two distinct numbers taken from among first n natural numbers.
- Product of all possible sums of three numbers taken from among first n natural numbers.A093884
Product of all possible sums of three numbers taken from among first n natural numbers.
- a(n) = floor( {product of all possible sums of (n-1) numbers chosen from among first n numbers} / {sum of all possible products of (n-1) numbers chosen from among first n numbers} ).A093885
a(n) = floor( {product of all possible sums of (n-1) numbers chosen from among first n numbers} / {sum of all possible products of (n-1) numbers chosen from among first n numbers} ).
- Least k such that k! is divisible by (1!*2!*3!*...*n!).A093886
Least k such that k! is divisible by (1!*2!*3!*...*n!).
- a(n) = (A093886(n))! / (1!*2!*3!*...*n!).A093887
a(n) = (A093886(n))! / (1!*2!*3!*...*n!).
- Largest palindromic divisor of n!.A093888
Largest palindromic divisor of n!.
- a(n) = n!/A093888(n).A093889
a(n) = n!/A093888(n).
- Number of primes arising as the sum of one or more divisors of n.A093890
Number of primes arising as the sum of one or more divisors of n.
- Numbers k such that every prime up to sigma(k) is a sum of divisors of k.A093891
Numbers k such that every prime up to sigma(k) is a sum of divisors of k.
- Index of first occurrence of n in A093890, or 0 if no such number exists.A093892
Index of first occurrence of n in A093890, or 0 if no such number exists.
- Numbers n such that every sum of two or more divisors is composite.A093893
Numbers n such that every sum of two or more divisors is composite.
- Composite members of A093893.A093894
Composite members of A093893.
- Duplicate of A030057.A093895
Duplicate of A030057.
- Least positive k such that n^n divides k!.A093896
Least positive k such that n^n divides k!.
- a(n) = A093896(n)! / n^n.A093897
a(n) = A093896(n)! / n^n.
- Triangle read by rows: T(n,r) = n^r + r^n (1 <= r <= n).A093898
Triangle read by rows: T(n,r) = n^r + r^n (1 <= r <= n).
- Triangle read by rows, consisting of distinct positive integers such that the absolute difference of (horizontally or vertically) adjacent numbers is a (least possible) distinct prime.A093899
Triangle read by rows, consisting of distinct positive integers such that the absolute difference of (horizontally or vertically) adjacent numbers is a (least possible) distinct prime.
- First column of triangle A093899.A093900
First column of triangle A093899.
- Leading diagonal of triangle A093899.A093901
Leading diagonal of triangle A093899.
- Absolute differences of adjacent entries in triangle A093899, alternately vertical and horizontal.A093902
Absolute differences of adjacent entries in triangle A093899, alternately vertical and horizontal.
- a(1) = 1; for n > 1, a(n) = a(n-1)-p if there exists a prime p (take the smallest) that has not yet been used and is such that a(n) is new and > 0, otherwise a(n) = a(n-1)+p if the same conditions are satisfied.A093903
a(1) = 1; for n > 1, a(n) = a(n-1)-p if there exists a prime p (take the smallest) that has not yet been used and is such that a(n) is new and > 0, otherwise a(n) = a(n-1)+p if the same conditions are satisfied.
- Duplicate of A093344.A093904
Duplicate of A093344.
- Triangle read by rows: for 0 <= k < n, a(n, k) is the sum of the products of all subsets of {n-k, n-k+1, ..., n} with k members.A093905
Triangle read by rows: for 0 <= k < n, a(n, k) is the sum of the products of all subsets of {n-k, n-k+1, ..., n} with k members.
- Start with {2} and close under the operations XY and XY+1; sequence gives complete list of numbers that do not appear.A093906
Start with {2} and close under the operations XY and XY+1; sequence gives complete list of numbers that do not appear.
- Number of elements in the n-th period of the periodic table as predicted by the Aufbau principle.A093907
Number of elements in the n-th period of the periodic table as predicted by the Aufbau principle.
- Let f(k, n) be the product of n consecutive numbers beginning with k. Then a(n) is the least k > 1+n*(n-1)/2 such that f(k, n) is a multiple of f(1+n*(n-1)/2, n).A093908
Let f(k, n) be the product of n consecutive numbers beginning with k. Then a(n) is the least k > 1+n*(n-1)/2 such that f(k, n) is a multiple of f(1+n*(n-1)/2, n).
- Let f(k, n) be the product of n consecutive numbers beginning with k. Then a(n) = f(A093908(n))/f(1+n*(n-1)/2).A093909
Let f(k, n) be the product of n consecutive numbers beginning with k. Then a(n) = f(A093908(n))/f(1+n*(n-1)/2).
- Product of n-th row of irregular triangle defined in A093911.A093910
Product of n-th row of irregular triangle defined in A093911.