Sequences
392,541 sequences
- Numbers n >= 4 that are not palindromic in any base b, 2 <= b <= n/2.A047811
Numbers n >= 4 that are not palindromic in any base b, 2 <= b <= n/2.
- Parker's partition triangle T(n,k) read by rows (n >= 1 and 0 <= k <= n-1).A047812
Parker's partition triangle T(n,k) read by rows (n >= 1 and 0 <= k <= n-1).
- Largest palindromic substring of n.A047813
Largest palindromic substring of n.
- Largest prime substring of n, or 0 if no such substring exists.A047814
Largest prime substring of n, or 0 if no such substring exists.
- Erroneous version of A095844.A047815
Erroneous version of A095844.
- Erroneous version of A095845.A047816
Erroneous version of A095845.
- Denominators of Hurwitz numbers H_n (coefficients in expansion of Weierstrass P-function).A047817
Denominators of Hurwitz numbers H_n (coefficients in expansion of Weierstrass P-function).
- a(n) is the least number m such that A002313(n)*m - 1 is a square.A047818
a(n) is the least number m such that A002313(n)*m - 1 is a square.
- a(n) = Product_{i=1..n} ((i+3)*(i+4)*(i+5))/(i*(i+1)*(i+2)).A047819
a(n) = Product_{i=1..n} ((i+3)*(i+4)*(i+5))/(i*(i+1)*(i+2)).
- Composite numbers that become prime after exactly 1 iteration of f(k) = sum of distinct prime factors of k.A047820
Composite numbers that become prime after exactly 1 iteration of f(k) = sum of distinct prime factors of k.
- Becomes prime after exactly 2 iterations of f(x) = sum of prime factors of x.A047821
Becomes prime after exactly 2 iterations of f(x) = sum of prime factors of x.
- Becomes prime after exactly 3 iterations of f(x) = sum of prime factors of x.A047822
Becomes prime after exactly 3 iterations of f(x) = sum of prime factors of x.
- Becomes prime after exactly 4 iterations of f(x) = sum of prime factors of x.A047823
Becomes prime after exactly 4 iterations of f(x) = sum of prime factors of x.
- Becomes prime after exactly 5 iterations of f(x) = sum of prime factors of x.A047824
Becomes prime after exactly 5 iterations of f(x) = sum of prime factors of x.
- Becomes prime after exactly 6 iterations of f(x) = sum of prime factors of x.A047825
Becomes prime after exactly 6 iterations of f(x) = sum of prime factors of x.
- Becomes prime after exactly 7 iterations of f(x) = sum of prime factors of x.A047826
Becomes prime after exactly 7 iterations of f(x) = sum of prime factors of x.
- Becomes prime after exactly 8 iterations of f(x) = sum of prime factors of x.A047827
Becomes prime after exactly 8 iterations of f(x) = sum of prime factors of x.
- Becomes prime after exactly 9 iterations of f(x) = sum of prime factors of x.A047828
Becomes prime after exactly 9 iterations of f(x) = sum of prime factors of x.
- Becomes prime after exactly 10 iterations of f(x) = sum of prime factors of x.A047829
Becomes prime after exactly 10 iterations of f(x) = sum of prime factors of x.
- Least number which becomes prime after exactly n iterations of f(x) = sum of prime factors of x.A047830
Least number which becomes prime after exactly n iterations of f(x) = sum of prime factors of x.
- a(n) = Product_{i=1..n} ((i+5)*(i+6)*(i+7)*(i+8)*(i+9))/(i*(i+1)*(i+2)*(i+3)*(i+4)).A047831
a(n) = Product_{i=1..n} ((i+5)*(i+6)*(i+7)*(i+8)*(i+9))/(i*(i+1)*(i+2)*(i+3)*(i+4)).
- Number of self-complementary binary relations on a 2n-element set.A047832
Number of self-complementary binary relations on a 2n-element set.
- Erroneous version of A002499.A047833
Erroneous version of A002499.
- Another erroneous version of A002499.A047834
Another erroneous version of A002499.
- a(n) = Product_{i=1..n} ((i+4)*(i+5)*(i+6)*(i+7))/(i*(i+1)*(i+2)*(i+3)).A047835
a(n) = Product_{i=1..n} ((i+4)*(i+5)*(i+6)*(i+7))/(i*(i+1)*(i+2)*(i+3)).
- "Nullwertzahlen" (or "inverse prime numbers"): n=p1*p2*p3*p4*p5*...*pk, where pi are primes with p1 <= p2 <= p3 <= p4 ...; then p1 = 2 and p1*p2*...*pi >= p(i+1) for all i < k.A047836
"Nullwertzahlen" (or "inverse prime numbers"): n=p1*p2*p3*p4*p5*...*pk, where pi are primes with p1 <= p2 <= p3 <= p4 ...; then p1 = 2 and p1*p2*...*pi >= p(i+1) for all i < k.
- Honaker's triangle problem: form a triangle with base of length n, all entries different, all row sums equal; a(n) gives minimal row sum.A047837
Honaker's triangle problem: form a triangle with base of length n, all entries different, all row sums equal; a(n) gives minimal row sum.
- a(n) = floor(n^2/2) - 1.A047838
a(n) = floor(n^2/2) - 1.
- a(n) = n + floor( sqrt(2*n) ).A047839
a(n) = n + floor( sqrt(2*n) ).
- Incorrect version of A037189.A047840
Incorrect version of A037189.
- Autobiographical numbers: Fixed under operator T (A047842): "Say what you see".A047841
Autobiographical numbers: Fixed under operator T (A047842): "Say what you see".
- Describe n (count digits in order of increasing value, ignoring missing digits).A047842
Describe n (count digits in order of increasing value, ignoring missing digits).
- Describe n: give frequency of each digit, by increasing size; mention also missing digits between the smallest and largest one.A047843
Describe n: give frequency of each digit, by increasing size; mention also missing digits between the smallest and largest one.
- Patrick De Geest's "Generations" array read by antidiagonals: a(n,1) = n-th prime, a(1,k+1) = a(2,k), a(n,k+1) = a(n-1,k) + a(n+1,k).A047844
Patrick De Geest's "Generations" array read by antidiagonals: a(n,1) = n-th prime, a(1,k+1) = a(2,k), a(n,k+1) = a(n-1,k) + a(n+1,k).
- a(n) = (m-1)/2, where m is the n-th odd nonprime (A014076(n)).A047845
a(n) = (m-1)/2, where m is the n-th odd nonprime (A014076(n)).
- Number of successive odd nonprimes (A014076).A047846
Number of successive odd nonprimes (A014076).
- Numbers n such that n + (n+1) and (n+2) + (n+3) are both prime.A047847
Numbers n such that n + (n+1) and (n+2) + (n+3) are both prime.
- Array A read by diagonals; n-th difference of (A(k,n), A(k,n-1),..., A(k,0)) is (k+2)^(n-1), for n=1,2,3,...; k=0,1,2,...A047848
Array A read by diagonals; n-th difference of (A(k,n), A(k,n-1),..., A(k,0)) is (k+2)^(n-1), for n=1,2,3,...; k=0,1,2,...
- a(n) = (4^n + 2)/3.A047849
a(n) = (4^n + 2)/3.
- a(n) = (5^n + 3)/4.A047850
a(n) = (5^n + 3)/4.
- a(n) = A047848(3,n).A047851
a(n) = A047848(3,n).
- a(n) = A047848(4, n).A047852
a(n) = A047848(4, n).
- a(n) = A047848(5, n).A047853
a(n) = A047848(5, n).
- a(n) = A047848(6, n).A047854
a(n) = A047848(6, n).
- a(n) = A047848(7,n).A047855
a(n) = A047848(7,n).
- a(n) = A047848(8, n).A047856
a(n) = A047848(8, n).
- a(n) = Sum_{k=0..n} A047848(k, n-k).A047857
a(n) = Sum_{k=0..n} A047848(k, n-k).
- T(n, k) = 2^(k-1)*(k + 2*n) - n + 1, array read by descending antidiagonals.A047858
T(n, k) = 2^(k-1)*(k + 2*n) - n + 1, array read by descending antidiagonals.
- a(n) = T(2, n), where T is the array given by A047858.A047859
a(n) = T(2, n), where T is the array given by A047858.
- a(n) = T(3,n), array T given by A047858.A047860
a(n) = T(3,n), array T given by A047858.