Sequences
392,541 sequences
- Numbers all of whose divisors can be formed using their digits. Divisor digits are a subset of the digits of the number.A092911
Numbers all of whose divisors can be formed using their digits. Divisor digits are a subset of the digits of the number.
- Numbers k all of whose divisors contain only digits that occur at least once in k.A092912
Numbers k all of whose divisors contain only digits that occur at least once in k.
- a(0) = 1; a(n) = least multiple of a(n-1) such that every k with a(n)-n <= k <= a(n) + n is composite. The least distance of a prime on either side from a(n) is >n.A092913
a(0) = 1; a(n) = least multiple of a(n-1) such that every k with a(n)-n <= k <= a(n) + n is composite. The least distance of a prime on either side from a(n) is >n.
- a(n) = (n-1)*(n-2)*...*(n-r) with the least value of r so that n divides a(n).A092914
a(n) = (n-1)*(n-2)*...*(n-r) with the least value of r so that n divides a(n).
- a(n) = largest k such that n divides (n-1)!/k!, or 0 if no such k exists (i.e., if n is prime).A092915
a(n) = largest k such that n divides (n-1)!/k!, or 0 if no such k exists (i.e., if n is prime).
- a(n) = A092914(n)/n = the least integer value of (n-1)!/(n*k!).A092916
a(n) = A092914(n)/n = the least integer value of (n-1)!/(n*k!).
- Group the natural numbers such that the n-th group sum is divisible by prime(n): (1, 2, 3), (4, 5), (6, 7, 8, 9), (10, 11), (12, 13, 14, 15, 16, 17, 18, 19, 20, 21), ... Sequence contains the last term of every group.A092917
Group the natural numbers such that the n-th group sum is divisible by prime(n): (1, 2, 3), (4, 5), (6, 7, 8, 9), (10, 11), (12, 13, 14, 15, 16, 17, 18, 19, 20, 21), ... Sequence contains the last term of every group.
- Number of connected hypergraphs (without multiple edges and without empty edges) on n labeled vertices.A092918
Number of connected hypergraphs (without multiple edges and without empty edges) on n labeled vertices.
- Partial sums of A000193 (round(log(n))).A092919
Partial sums of A000193 (round(log(n))).
- Number of strongly monotone partitions of [n].A092920
Number of strongly monotone partitions of [n].
- Array F(k, n) read by descending antidiagonals: k-generalized Fibonacci numbers in row k >= 1, starting (0, 1, 1, ...), for column n >= 0.A092921
Array F(k, n) read by descending antidiagonals: k-generalized Fibonacci numbers in row k >= 1, starting (0, 1, 1, ...), for column n >= 0.
- a(1) = prime(1), a(2) = prime(prime( a(1) )), a(3) = prime(prime(prime( a(2) ))), a(4) = prime(prime(prime(prime( a(3) )))), etc.A092922
a(1) = prime(1), a(2) = prime(prime( a(1) )), a(3) = prime(prime(prime( a(2) ))), a(4) = prime(prime(prime(prime( a(3) )))), etc.
- Number of permutations containing exactly one occurrence of the pattern #, with # one of {1-23, 3-21, 12-3, 32-1}.A092923
Number of permutations containing exactly one occurrence of the pattern #, with # one of {1-23, 3-21, 12-3, 32-1}.
- Expansion of a Schwarzian ({f_{32|8}, tau} / (4*Pi)^2) in powers of q^8.A092924
Expansion of a Schwarzian ({f_{32|8}, tau} / (4*Pi)^2) in powers of q^8.
- Smallest prime of the form n(n-1)(n-2)...(n-k)-1, or 0 if no such prime exists.A092925
Smallest prime of the form n(n-1)(n-2)...(n-k)-1, or 0 if no such prime exists.
- Value of k pertaining to A092925. a(n) = k if n*(n-1)*(n-2)...*(n-k)-1 is the least prime of this form.A092926
Value of k pertaining to A092925. a(n) = k if n*(n-1)*(n-2)...*(n-k)-1 is the least prime of this form.
- Smallest prime of the form n(n-1)(n-2)...(n-k)+1, or 0 if no such prime exists.A092927
Smallest prime of the form n(n-1)(n-2)...(n-k)+1, or 0 if no such prime exists.
- Value of k pertaining to A092927: value of k such that n(n-1)(n-2)...(n-k)+1 is the least prime of this form; a(n)=-1 if no such k exists, i.e., A092927(n)=0.A092928
Value of k pertaining to A092927: value of k such that n(n-1)(n-2)...(n-k)+1 is the least prime of this form; a(n)=-1 if no such k exists, i.e., A092927(n)=0.
- n-th partial arithmetic mean is equal to the n-th noncomposite number or to prime(n-1) for n>1.A092929
n-th partial arithmetic mean is equal to the n-th noncomposite number or to prime(n-1) for n>1.
- n-th partial arithmetic mean is equal to the n-th composite number.A092930
n-th partial arithmetic mean is equal to the n-th composite number.
- Number of ways of factorizing n into parts whose sum divides n.A092931
Number of ways of factorizing n into parts whose sum divides n.
- Index of first occurrence of n in A092931, or 0 if n does not appear.A092932
Index of first occurrence of n in A092931, or 0 if n does not appear.
- Let 1, a, b, c,... be the numbers coprime to k in ascending order; then k belongs to this sequence if k = a partial sum of these numbers.A092933
Let 1, a, b, c,... be the numbers coprime to k in ascending order; then k belongs to this sequence if k = a partial sum of these numbers.
- a(n) = floor((product of next n even numbers) / (product of first n odd numbers)).A092934
a(n) = floor((product of next n even numbers) / (product of first n odd numbers)).
- a(1) = 1; a(n) = floor {(n+1)(n+2)(n+3)...(n+k)}/{(n-1)(n-2)(n-3)...(n-k)} for the least value of k.A092935
a(1) = 1; a(n) = floor {(n+1)(n+2)(n+3)...(n+k)}/{(n-1)(n-2)(n-3)...(n-k)} for the least value of k.
- Area of n-th triple of hexagons around a triangle.A092936
Area of n-th triple of hexagons around a triangle.
- Differences nextprime(2k) - precprime(2k) having maximum prime density for 2k <= 10^n.A092937
Differences nextprime(2k) - precprime(2k) having maximum prime density for 2k <= 10^n.
- a(n) = least prime p such that 2*prime(n) - p is prime.A092938
a(n) = least prime p such that 2*prime(n) - p is prime.
- Index of the first occurrence of prime(n) in A092938.A092939
Index of the first occurrence of prime(n) in A092938.
- a(n) = largest prime p such that 2*prime(n) - p is prime.A092940
a(n) = largest prime p such that 2*prime(n) - p is prime.
- Duplicate of A075393.A092941
Duplicate of A075393.
- A Fibonacci sequence with "corrections" at every third step: -++-++-++-++-++..., i.e., at every 3rd step there is a subtraction instead of an addition.A092942
A Fibonacci sequence with "corrections" at every third step: -++-++-++-++-++..., i.e., at every 3rd step there is a subtraction instead of an addition.
- Time wave sequence of Terrance McKenna.A092943
Time wave sequence of Terrance McKenna.
- Group the natural numbers so that the n-th group contains n numbers whose sum as well as the group product + 1 is prime. Sequence contains the first member of the groups.A092944
Group the natural numbers so that the n-th group contains n numbers whose sum as well as the group product + 1 is prime. Sequence contains the first member of the groups.
- Group the natural numbers so that the n-th group contains n numbers whose sum as well as the group product + 1 is prime. Sequence contains the last term of each group.A092945
Group the natural numbers so that the n-th group contains n numbers whose sum as well as the group product + 1 is prime. Sequence contains the last term of each group.
- Group the natural numbers so that the n-th group contains n numbers whose sum as well as the group product +1 is prime. Sequence contains the primes arising as the sum of the terms of groups.A092946
Group the natural numbers so that the n-th group contains n numbers whose sum as well as the group product +1 is prime. Sequence contains the primes arising as the sum of the terms of groups.
- Group the natural numbers so that the n-th group contains n numbers whose sum as well as the group product +1 is prime. Sequence contains the primes arising as the product of the terms of groups +1.A092947
Group the natural numbers so that the n-th group contains n numbers whose sum as well as the group product +1 is prime. Sequence contains the primes arising as the product of the terms of groups +1.
- Generator array for timewave sequence A092943.A092948
Generator array for timewave sequence A092943.
- Numbers of the form prime(n+1) + prime(n) + 1.A092949
Numbers of the form prime(n+1) + prime(n) + 1.
- Beginning with n, add the next number, subtract the previous number and so on until one gets a prime, or 0 if no such prime is reached in 2n-1 steps: a(n) = n + (n+1) - (n-1) +(n+2) -(n-2) +(n+3)-(n-3)...+...is the first occurring prime at any step.A092950
Beginning with n, add the next number, subtract the previous number and so on until one gets a prime, or 0 if no such prime is reached in 2n-1 steps: a(n) = n + (n+1) - (n-1) +(n+2) -(n-2) +(n+3)-(n-3)...+...is the first occurring prime at any step.
- Beginning with n, add the next number, subtract the previous number, and so on; then a(n) is the largest prime arising in this process, or 0 if no prime is reached in 2n-1 steps: a(n) is the largest occurring prime in the sum n + (n+1) - (n-1) + (n+2) - (n-2) + (n+3) - (n-3) + ... +- 1 occurring at any stage.A092951
Beginning with n, add the next number, subtract the previous number, and so on; then a(n) is the largest prime arising in this process, or 0 if no prime is reached in 2n-1 steps: a(n) is the largest occurring prime in the sum n + (n+1) - (n-1) + (n+2) - (n-2) + (n+3) - (n-3) + ... +- 1 occurring at any stage.
- Smallest unhappy number that takes n iterations of the sum of the squares of digits to reach 4, which is the smallest number of the unhappy numbers cycle.A092952
Smallest unhappy number that takes n iterations of the sum of the squares of digits to reach 4, which is the smallest number of the unhappy numbers cycle.
- Number of primes of the form n+p, where p is a prime < n.A092953
Number of primes of the form n+p, where p is a prime < n.
- Index of the first occurrence of n in A092953. There are a(n) primes p < n such that n+p is a prime.A092954
Index of the first occurrence of n in A092953. There are a(n) primes p < n such that n+p is a prime.
- Starting at the integer 0, add one of each base-n digit in base n to a pile and then take from this pile the digits required to construct the current integer. Continue consecutively until reaching an integer, a(n), that requires digits not in the pile.A092955
Starting at the integer 0, add one of each base-n digit in base n to a pile and then take from this pile the digits required to construct the current integer. Continue consecutively until reaching an integer, a(n), that requires digits not in the pile.
- a(n) = (2*n+2)!/((n+2)*n!).A092956
a(n) = (2*n+2)!/((n+2)*n!).
- In the triangle 1 / 1*2 2*3 / 1*2*3 2*3*4 3*4*5 / ... if every number k is replaced by prime(k) one gets the following triangle 2 / 6 15 / 30 105 385 / 210 1155 5005 17017 / ... Sequence contains the row sums.A092957
In the triangle 1 / 1*2 2*3 / 1*2*3 2*3*4 3*4*5 / ... if every number k is replaced by prime(k) one gets the following triangle 2 / 6 15 / 30 105 385 / 210 1155 5005 17017 / ... Sequence contains the row sums.
- a(1) = 1, a(2) = (1+2)*(2+3), a(3) = (1+2+3)*(2+3+4)*(3+4+5), ... etc. Or a(n) = (T(n))*(T(n)+n)*(T(n)+2n)*(T(n)+3n)*... n terms. where T(n) = n(n+1)/2 given by A000217.A092958
a(1) = 1, a(2) = (1+2)*(2+3), a(3) = (1+2+3)*(2+3+4)*(3+4+5), ... etc. Or a(n) = (T(n))*(T(n)+n)*(T(n)+2n)*(T(n)+3n)*... n terms. where T(n) = n(n+1)/2 given by A000217.
- Least square of the form 'product of n successive terms of an arithmetic progression + 1', or 0 if no such square exists.A092959
Least square of the form 'product of n successive terms of an arithmetic progression + 1', or 0 if no such square exists.
- Least square of the form 'sum of n successive terms of a geometric progression + 1', or 0 if no such square exists.A092960
Least square of the form 'sum of n successive terms of a geometric progression + 1', or 0 if no such square exists.