Sequences
392,541 sequences
- Smallest number m such that m and the product of digits of m are both divisible by 5n, or 0 if no such number exists.A073911
Smallest number m such that m and the product of digits of m are both divisible by 5n, or 0 if no such number exists.
- Smallest number m such that m and the product of digits of m are both divisible by 8n, or 0 if no such number exists.A073912
Smallest number m such that m and the product of digits of m are both divisible by 8n, or 0 if no such number exists.
- Number of staircase polygons on the square lattice with perimeter 2n and one (possibly rotated) staircase polygonal hole.A073913
Number of staircase polygons on the square lattice with perimeter 2n and one (possibly rotated) staircase polygonal hole.
- Triangle read by rows in which row n gives n smallest n-digit primes.A073914
Triangle read by rows in which row n gives n smallest n-digit primes.
- Triangle read by rows in which the n-th row contains the first n numbers with n divisors.A073915
Triangle read by rows in which the n-th row contains the first n numbers with n divisors.
- The n-th number with n divisors.A073916
The n-th number with n divisors.
- Smallest prime which leaves a remainder 1 when divided by primorial(n), i.e., when divided by first n primes.A073917
Smallest prime which leaves a remainder 1 when divided by primorial(n), i.e., when divided by first n primes.
- Smallest prime which is 1 more than a product of n distinct primes: a(n) is a prime and a(n) - 1 is a squarefree number with n prime factors.A073918
Smallest prime which is 1 more than a product of n distinct primes: a(n) is a prime and a(n) - 1 is a squarefree number with n prime factors.
- Smallest prime p with bigomega(p-1)=n, where bigomega(m)=A001222(m) is the number of prime divisors of m (counted with multiplicity).A073919
Smallest prime p with bigomega(p-1)=n, where bigomega(m)=A001222(m) is the number of prime divisors of m (counted with multiplicity).
- a(1)=1 and then odd numbers rearranged such that a(n) is prime if n is composite else vice versa.A073920
a(1)=1 and then odd numbers rearranged such that a(n) is prime if n is composite else vice versa.
- Odd numbers which retain their position in the rearrangement of A073920: terms of A073920 for which a(n) = 2n-1.A073921
Odd numbers which retain their position in the rearrangement of A073920: terms of A073920 for which a(n) = 2n-1.
- a(1) = 1, a(n) = smallest composite number greater than n and not occurring earlier if n is prime, or smallest prime number greater than n and not occurring earlier if n is composite.A073922
a(1) = 1, a(n) = smallest composite number greater than n and not occurring earlier if n is prime, or smallest prime number greater than n and not occurring earlier if n is composite.
- a(1)=1, a(n) is the smallest power of 2 not included earlier such that Sum_{k=1..n} a(k) is prime.A073923
a(1)=1, a(n) is the smallest power of 2 not included earlier such that Sum_{k=1..n} a(k) is prime.
- Smallest power of 2 that is greater than the previous term such that every partial sum (n>1) is a prime.A073924
Smallest power of 2 that is greater than the previous term such that every partial sum (n>1) is a prime.
- Powers of 2 rearranged such that every partial sum (n>1) is composite.A073925
Powers of 2 rearranged such that every partial sum (n>1) is composite.
- Powers of 2 rearranged so that every partial sum after 1 is a proper prime power.A073926
Powers of 2 rearranged so that every partial sum after 1 is a proper prime power.
- Smallest n-th power >1 such that every partial sum is a prime.A073927
Smallest n-th power >1 such that every partial sum is a prime.
- Smallest prime q of form q=-1+(c+1)*10^w, where c runs through composites not divisible by 3.A073928
Smallest prime q of form q=-1+(c+1)*10^w, where c runs through composites not divisible by 3.
- a(1) = 1, a(n) = smallest number not included earlier such that the n-th partial sum (n>1) is divisible by n+1.A073929
a(1) = 1, a(n) = smallest number not included earlier such that the n-th partial sum (n>1) is divisible by n+1.
- Numbers that are equal to the sum of their anti-divisors.A073930
Numbers that are equal to the sum of their anti-divisors.
- Numbers n such that the sum of the anti-divisors of n = 2n.A073931
Numbers n such that the sum of the anti-divisors of n = 2n.
- Define f(n) = n - largest nontrivial divisor of n or f(n) = n-1 if n is a prime [that is, f(n) = A060681(n)]. Form a triangle in which the n-th row contains terms n, f(n), f(f(n)), ... until a 1 is reached; sequence gives triangle read by rows.A073932
Define f(n) = n - largest nontrivial divisor of n or f(n) = n-1 if n is a prime [that is, f(n) = A060681(n)]. Form a triangle in which the n-th row contains terms n, f(n), f(f(n)), ... until a 1 is reached; sequence gives triangle read by rows.
- Number of terms in n-th row of triangle in A073932.A073933
Number of terms in n-th row of triangle in A073932.
- Sum of terms in n-th row of triangle in A073932.A073934
Sum of terms in n-th row of triangle in A073932.
- Numbers n such that the n-th row of triangle in A073932 contains exactly the divisors of n.A073935
Numbers n such that the n-th row of triangle in A073932 contains exactly the divisors of n.
- Numbers k such that 2^k + 1 is the product of two distinct primes.A073936
Numbers k such that 2^k + 1 is the product of two distinct primes.
- a(n) = a(n-1) - a(n-2) + a(n-3) + a(n-4), a(0)=4, a(1)=1, a(2)=-1, a(3)=1.A073937
a(n) = a(n-1) - a(n-2) + a(n-3) + a(n-4), a(0)=4, a(1)=1, a(2)=-1, a(3)=1.
- Numbers n such that A078142(n) = A078142(n+1) = A078142(n+2), where A078142(n) is the sum of the differences of the distinct prime factors p of n and the next square larger than p.A073938
Numbers n such that A078142(n) = A078142(n+1) = A078142(n+2), where A078142(n) is the sum of the differences of the distinct prime factors p of n and the next square larger than p.
- Least m such that A078142(m) gives the n-th prime, where A078142(n) is the sum of the differences of the distinct prime factors p of n and the next square larger than p.A073939
Least m such that A078142(m) gives the n-th prime, where A078142(n) is the sum of the differences of the distinct prime factors p of n and the next square larger than p.
- Number of n X n matrices over an alphabet of size 14.A073940
Number of n X n matrices over an alphabet of size 14.
- a(n) = ceiling((Sum_{k=1..n-1} a(k)) / 2) for n >= 2 starting with a(1) = 1.A073941
a(n) = ceiling((Sum_{k=1..n-1} a(k)) / 2) for n >= 2 starting with a(1) = 1.
- Numbers k such that A002977(k) - A002977(k-1) = 1.A073942
Numbers k such that A002977(k) - A002977(k-1) = 1.
- a(n) = smallest m such that n-th prime divides m^m + 1.A073943
a(n) = smallest m such that n-th prime divides m^m + 1.
- a(n) is the smallest m such that n-th prime divides m! + 1.A073944
a(n) is the smallest m such that n-th prime divides m! + 1.
- Numbers n such that n + pi(n) is a square.A073945
Numbers n such that n + pi(n) is a square.
- Squares k such that k + pi(k) is a prime.A073946
Squares k such that k + pi(k) is a prime.
- Number of strings over Z_3 of length n with trace 0 and subtrace 0.A073947
Number of strings over Z_3 of length n with trace 0 and subtrace 0.
- Number of strings over Z_3 of length n with trace 0 and subtrace 1.A073948
Number of strings over Z_3 of length n with trace 0 and subtrace 1.
- Number of strings over Z_3 of length n with trace 0 and subtrace 2.A073949
Number of strings over Z_3 of length n with trace 0 and subtrace 2.
- Number of strings over Z_3 of length n with trace 1 and subtrace 0.A073950
Number of strings over Z_3 of length n with trace 1 and subtrace 0.
- Number of strings over Z_3 of length n with trace 1 and subtrace 1.A073951
Number of strings over Z_3 of length n with trace 1 and subtrace 1.
- Number of strings over Z_3 of length n with trace 1 and subtrace 2.A073952
Number of strings over Z_3 of length n with trace 1 and subtrace 2.
- Erroneous duplicate of A068620.A073953
Erroneous duplicate of A068620.
- Numbers k such that the sum of the anti-divisors of k exceeds 2*k.A073954
Numbers k such that the sum of the anti-divisors of k exceeds 2*k.
- Erroneous duplicate of A068774.A073955
Erroneous duplicate of A068774.
- Palindromes whose sum of anti-divisors is palindromic.A073956
Palindromes whose sum of anti-divisors is palindromic.
- Indices of records of the sum of the anti-divisors function.A073957
Indices of records of the sum of the anti-divisors function.
- Fibonacci numbers for which the number of prime factors (with multiplicity) is a Fibonacci number.A073958
Fibonacci numbers for which the number of prime factors (with multiplicity) is a Fibonacci number.
- Erroneous duplicate of A068787.A073959
Erroneous duplicate of A068787.
- Number of commuting elements: number of ordered pairs g, h in the group GL(n,2) such that gh = hg.A073960
Number of commuting elements: number of ordered pairs g, h in the group GL(n,2) such that gh = hg.