Sequences
392,541 sequences
- Primes arising in A089710.A089711
Primes arising in A089710.
- Smallest prime as a concatenation k and k-n.A089712
Smallest prime as a concatenation k and k-n.
- a(n) is the largest prime that is the concatenation of n and m for some m < n, or 0 if no such prime exists.A089713
a(n) is the largest prime that is the concatenation of n and m for some m < n, or 0 if no such prime exists.
- Duplicate of A070219.A089714
Duplicate of A070219.
- a(n) = {A089713(n)+A070219(n)}/2.A089715
a(n) = {A089713(n)+A070219(n)}/2.
- Primes that are both congruent to 1 mod 10 and congruent to 1 or 2 mod 9.A089716
Primes that are both congruent to 1 mod 10 and congruent to 1 or 2 mod 9.
- Triangular numbers with palindromic indices.A089717
Triangular numbers with palindromic indices.
- a(0) = 1, a(n) = number obtained by multiplying each digit of a(n-1) by n. May be called digitfactorial of n.A089718
a(0) = 1, a(n) = number obtained by multiplying each digit of a(n-1) by n. May be called digitfactorial of n.
- Pseudofactor sets of primes ending in 1: 9 greater than 3.A089719
Pseudofactor sets of primes ending in 1: 9 greater than 3.
- Primes == 1 or 11 (mod 70).A089720
Primes == 1 or 11 (mod 70).
- Primes ending in 1 such that floor(p/7) ends in a digit > 3.A089721
Primes ending in 1 such that floor(p/7) ends in a digit > 3.
- Triangle T(n,k), 0<=k<=n, read by rows, defined by: Product{k=1..n, (1+x^k)^(n+1-k)} = Sum{k>=0, T(n,k)*x^k}.A089722
Triangle T(n,k), 0<=k<=n, read by rows, defined by: Product{k=1..n, (1+x^k)^(n+1-k)} = Sum{k>=0, T(n,k)*x^k}.
- a(1)=1; for n>1, a(n) gives number of ways to write n as n = x^y, 2 <= x, 1 <= y.A089723
a(1)=1; for n>1, a(n) gives number of ways to write n as n = x^y, 2 <= x, 1 <= y.
- Numbers p satisfying the following conditions: p is a prime of form 10k+9 and the function f[p,7,10] applied to p is not greater than 5, where f[p,7,10]=10*fractionalpart[n/70]=1*.((n/70)-Floor[n/70]).A089724
Numbers p satisfying the following conditions: p is a prime of form 10k+9 and the function f[p,7,10] applied to p is not greater than 5, where f[p,7,10]=10*fractionalpart[n/70]=1*.((n/70)-Floor[n/70]).
- Let f(n) = (2n+1), g(n) = (n-1)/2. Then a(n) = f(f(f(...(n)))), where one gets prime at every step. If f(n) is not a prime then a(n) = g(g(g...(n)))) where one gets a prime at every step. If f(n) and g(n) both are composite then a(n) = 0.A089725
Let f(n) = (2n+1), g(n) = (n-1)/2. Then a(n) = f(f(f(...(n)))), where one gets prime at every step. If f(n) is not a prime then a(n) = g(g(g...(n)))) where one gets a prime at every step. If f(n) and g(n) both are composite then a(n) = 0.
- Smallest prime of the form nk+1, k > n.A089726
Smallest prime of the form nk+1, k > n.
- Largest prime of the form n*k+1, k <= n.A089727
Largest prime of the form n*k+1, k <= n.
- Erroneous version of A111296.A089728
Erroneous version of A111296.
- Decimal expansion of Levy's constant 12*log(2)/Pi^2.A089729
Decimal expansion of Levy's constant 12*log(2)/Pi^2.
- Greatest prime factor of all differences prime(n)-q, q prime and q<prime(n); a(1)=0.A089730
Greatest prime factor of all differences prime(n)-q, q prime and q<prime(n); a(1)=0.
- Triangle of T(n,k)=number of peakless Motzkin paths of length n having k (1,0) steps at level zero (can be easily translated into RNA secondary structure terminology).A089731
Triangle of T(n,k)=number of peakless Motzkin paths of length n having k (1,0) steps at level zero (can be easily translated into RNA secondary structure terminology).
- Triangle read by rows: T(n,k) = number of peakless Motzkin paths of length n having k (1,1) steps (can be easily translated into RNA secondary structure terminology). Except for row 0, row n has ceiling(n/2) entries.A089732
Triangle read by rows: T(n,k) = number of peakless Motzkin paths of length n having k (1,1) steps (can be easily translated into RNA secondary structure terminology). Except for row 0, row n has ceiling(n/2) entries.
- Begin with 1; add a distinct prime to get a composite number, then add a distinct composite number to get a prime; repeat.A089733
Begin with 1; add a distinct prime to get a composite number, then add a distinct composite number to get a prime; repeat.
- Smallest b (b >=0) such that 6*n+1= p + 2*b^2, p prime.A089734
Smallest b (b >=0) such that 6*n+1= p + 2*b^2, p prime.
- Self-convolution of A004148 (the RNA secondary structure numbers) with itself.A089735
Self-convolution of A004148 (the RNA secondary structure numbers) with itself.
- Triangle read by rows: T(n,k) = number of peakless Motzkin paths of length n having k (1,1) steps starting at level zero (can be easily expressed also in RNA secondary structure terminology).A089736
Triangle read by rows: T(n,k) = number of peakless Motzkin paths of length n having k (1,1) steps starting at level zero (can be easily expressed also in RNA secondary structure terminology).
- Number of (1,1) steps starting at level zero in all peakless Motzkin paths of length n+3.A089737
Number of (1,1) steps starting at level zero in all peakless Motzkin paths of length n+3.
- Triangle of T(n,k)=number of peakless Motzkin paths of length n containing k valleys (can be easily expressed using RNA secondary structure terminology).A089738
Triangle of T(n,k)=number of peakless Motzkin paths of length n containing k valleys (can be easily expressed using RNA secondary structure terminology).
- Let b(m)= base ten expansion of prime(n); then a(n)=Sum[Mod(10-b(l),10)*10^l,{l,1,10}].A089739
Let b(m)= base ten expansion of prime(n); then a(n)=Sum[Mod(10-b(l),10)*10^l,{l,1,10}].
- Primes which are digital complements (A055120) of primes.A089740
Primes which are digital complements (A055120) of primes.
- Triangle read by rows: T(n,k) = number of peakless Motzkin paths of length n containing k UHH...HD's, where U=(1,1), D=(1,-1) and H=(1,0) (can be easily expressed using RNA secondary structure terminology).A089741
Triangle read by rows: T(n,k) = number of peakless Motzkin paths of length n containing k UHH...HD's, where U=(1,1), D=(1,-1) and H=(1,0) (can be easily expressed using RNA secondary structure terminology).
- Number of subwords UHH...HD in all peakless Motzkin paths of length n+3, where U=(1,1), D=(1,-1) and H=(1,0).A089742
Number of subwords UHH...HD in all peakless Motzkin paths of length n+3, where U=(1,1), D=(1,-1) and H=(1,0).
- Numbers that are the leading digits of a palindromic prime.A089743
Numbers that are the leading digits of a palindromic prime.
- Least palindromic prime beginning with A089743(n).A089744
Least palindromic prime beginning with A089743(n).
- a(n) = direuler(p=2,n,1/(1-X)/(1-p*n*X))[n].A089745
a(n) = direuler(p=2,n,1/(1-X)/(1-p*n*X))[n].
- Period 12: repeat (4, 4, 1, 2, 1, 1, 2, 2, 3, 3, 3, 3). (Number of syllables in English name of the months.)A089746
Period 12: repeat (4, 4, 1, 2, 1, 1, 2, 2, 3, 3, 3, 3). (Number of syllables in English name of the months.)
- Numbers n such that n^2 - 2n + 5 is prime.A089747
Numbers n such that n^2 - 2n + 5 is prime.
- Numbers k that divide (sum of proper divisors of k + product of proper divisors of k).A089748
Numbers k that divide (sum of proper divisors of k + product of proper divisors of k).
- a(n) = smallest m > a(n-1) such that concatenation nm is a prime.A089749
a(n) = smallest m > a(n-1) such that concatenation nm is a prime.
- a(n) = the first prime in the orbit of n under f(n) = n + the first prime > n, or 0 if no such prime exists.A089750
a(n) = the first prime in the orbit of n under f(n) = n + the first prime > n, or 0 if no such prime exists.
- a(n) = the first prime in the orbit of n under f(n) = n^2 + 1, if it exists; = 0 otherwise.A089751
a(n) = the first prime in the orbit of n under f(n) = n^2 + 1, if it exists; = 0 otherwise.
- Erroneous version of A264759.A089752
Erroneous version of A264759.
- Number of projections of alternating knots and links with n crossings.A089753
Number of projections of alternating knots and links with n crossings.
- Smallest prime ending (least significant side) in n if possible else beginning in n.A089754
Smallest prime ending (least significant side) in n if possible else beginning in n.
- a(1)=11; for n>1, a(n) is the smallest prime not occurring earlier beginning with a(n-1) without its first digit. Single-digit primes are not allowed unless they arise from the previous term as multi-digit number with leading zero(s) (i.e., a(n-1) has 0 as second digit) which are remembered for the subsequent left-truncations.A089755
a(1)=11; for n>1, a(n) is the smallest prime not occurring earlier beginning with a(n-1) without its first digit. Single-digit primes are not allowed unless they arise from the previous term as multi-digit number with leading zero(s) (i.e., a(n-1) has 0 as second digit) which are remembered for the subsequent left-truncations.
- a(1)=1 and a(i+1)=a(i)+9 if a(i)<=35, and a(i+1)=a(i)-35 if a(i)>35.A089756
a(1)=1 and a(i+1)=a(i)+9 if a(i)<=35, and a(i+1)=a(i)-35 if a(i)>35.
- Distinct multiples of 3 such that the concatenation of a(n), a(n-1), ..., a(2), a(1), 1 is a prime and a(n) > a(n-1).A089757
Distinct multiples of 3 such that the concatenation of a(n), a(n-1), ..., a(2), a(1), 1 is a prime and a(n) > a(n-1).
- Primes arising in A089757.A089758
Primes arising in A089757.
- Table T(n,k), 0<=k, 0<=n, read by antidiagonals, defined by T(n,k) = (k*n)! / (n!)^k.A089759
Table T(n,k), 0<=k, 0<=n, read by antidiagonals, defined by T(n,k) = (k*n)! / (n!)^k.
- Smallest prime which is a concatenation of n n-th powers. 1 is considered an n-th power for every value of n.A089760
Smallest prime which is a concatenation of n n-th powers. 1 is considered an n-th power for every value of n.