Sequences
392,541 sequences
- Beginning with a(1) = 1, choose a(n+1) so that concatenation a(n+1), a(n), a(n+1) is a new prime.A090261
Beginning with a(1) = 1, choose a(n+1) so that concatenation a(n+1), a(n), a(n+1) is a new prime.
- Numbers n such that the strings n1n and 1n1 are both prime.A090262
Numbers n such that the strings n1n and 1n1 are both prime.
- Numbers n such that the strings n3n and 3n3 are both prime.A090263
Numbers n such that the strings n3n and 3n3 are both prime.
- Numbers n such that the strings n7n and 7n7 are both prime.A090264
Numbers n such that the strings n7n and 7n7 are both prime.
- Numbers n such that the strings n9n and 9n9 are both prime.A090265
Numbers n such that the strings n9n and 9n9 are both prime.
- Least k such that concatenation k, prime(n), k is a prime.A090266
Least k such that concatenation k, prime(n), k is a prime.
- Primes arising in A090266.A090267
Primes arising in A090266.
- Smallest prime obtained by sandwiching prime(n) between identical digits, except that a(5) = 0.A090268
Smallest prime obtained by sandwiching prime(n) between identical digits, except that a(5) = 0.
- Least k made of identical digits such that the concatenation k, prime(n), k is prime. a(5) = 0.A090269
Least k made of identical digits such that the concatenation k, prime(n), k is prime. a(5) = 0.
- Least positive r such that concatenation k, r, k is prime, where k == 1,3,7 or 9 (mod 10) in increasing order.A090270
Least positive r such that concatenation k, r, k is prime, where k == 1,3,7 or 9 (mod 10) in increasing order.
- Palindromes in A090272.A090271
Palindromes in A090272.
- Take each palindrome ending in 1, 3, 7, or 9 and find smallest prime formed by the digits of that palindrome, followed by a string of digits, followed by the palindrome again.A090272
Take each palindrome ending in 1, 3, 7, or 9 and find smallest prime formed by the digits of that palindrome, followed by a string of digits, followed by the palindrome again.
- Numbers with a palindromic digital product.A090273
Numbers with a palindromic digital product.
- Numbers with a nonzero palindromic digital product (contains no zeros).A090274
Numbers with a nonzero palindromic digital product (contains no zeros).
- Beginning with 2, a(n+1) is the smallest palindromic prime obtained by placing identical digits on both sides of a(n).A090275
Beginning with 2, a(n+1) is the smallest palindromic prime obtained by placing identical digits on both sides of a(n).
- Least number with identical digits such that the concatenation a(n) a(n-1) ...a(2)a(1) a(2) ... a(n-1) a(n) is a prime.A090276
Least number with identical digits such that the concatenation a(n) a(n-1) ...a(2)a(1) a(2) ... a(n-1) a(n) is a prime.
- "Plain Bob Minimus" in bell-ringing is a sequence of permutations p_1=(1,2,3,4), p_2=(2,1,4,3), .. which runs through all permutations of {1,2,3,4} with period 24; sequence gives number in position 1 of n-th permutation.A090277
"Plain Bob Minimus" in bell-ringing is a sequence of permutations p_1=(1,2,3,4), p_2=(2,1,4,3), .. which runs through all permutations of {1,2,3,4} with period 24; sequence gives number in position 1 of n-th permutation.
- "Plain Bob Minimus" in bell-ringing is a sequence of permutations p_1=(1,2,3,4), p_2=(2,1,4,3), .. which runs through all permutations of {1,2,3,4} with period 24; sequence gives number in position 2 of n-th permutation.A090278
"Plain Bob Minimus" in bell-ringing is a sequence of permutations p_1=(1,2,3,4), p_2=(2,1,4,3), .. which runs through all permutations of {1,2,3,4} with period 24; sequence gives number in position 2 of n-th permutation.
- "Plain Bob Minimus" in bell-ringing is a sequence of permutations p_1=(1,2,3,4), p_2=(2,1,4,3), .. which runs through all permutations of {1,2,3,4} with period 24; sequence gives number in position 3 of n-th permutation.A090279
"Plain Bob Minimus" in bell-ringing is a sequence of permutations p_1=(1,2,3,4), p_2=(2,1,4,3), .. which runs through all permutations of {1,2,3,4} with period 24; sequence gives number in position 3 of n-th permutation.
- "Plain Bob Minimus" in bell-ringing is a sequence of permutations p_1=(1,2,3,4), p_2=(2,1,4,3), .. which runs through all permutations of {1,2,3,4} with period 24; sequence gives number in position 4 of n-th permutation.A090280
"Plain Bob Minimus" in bell-ringing is a sequence of permutations p_1=(1,2,3,4), p_2=(2,1,4,3), .. which runs through all permutations of {1,2,3,4} with period 24; sequence gives number in position 4 of n-th permutation.
- "Plain Bob Minimus" in bell-ringing is a sequence of permutations p_1=(1,2,3,4), p_2=(2,1,4,3), ... which runs through all permutations of {1,2,3,4} with period 24; sequence gives position of bell 1 (the treble bell) in n-th permutation.A090281
"Plain Bob Minimus" in bell-ringing is a sequence of permutations p_1=(1,2,3,4), p_2=(2,1,4,3), ... which runs through all permutations of {1,2,3,4} with period 24; sequence gives position of bell 1 (the treble bell) in n-th permutation.
- "Plain Bob Minimus" in bell-ringing is a sequence of permutations p_1=(1,2,3,4), p_2=(2,1,4,3), .. which runs through all permutations of {1,2,3,4} with period 24; sequence gives position of bell 2 in n-th permutation.A090282
"Plain Bob Minimus" in bell-ringing is a sequence of permutations p_1=(1,2,3,4), p_2=(2,1,4,3), .. which runs through all permutations of {1,2,3,4} with period 24; sequence gives position of bell 2 in n-th permutation.
- "Plain Bob Minimus" in bell-ringing is a sequence of permutations p_1=(1,2,3,4), p_2=(2,1,4,3), .. which runs through all permutations of {1,2,3,4} with period 24; sequence gives position of bell 3 in n-th permutation.A090283
"Plain Bob Minimus" in bell-ringing is a sequence of permutations p_1=(1,2,3,4), p_2=(2,1,4,3), .. which runs through all permutations of {1,2,3,4} with period 24; sequence gives position of bell 3 in n-th permutation.
- "Plain Bob Minimus" in bell-ringing is a sequence of permutations p_1=(1,2,3,4), p_2=(2,1,4,3), .. which runs through all permutations of {1,2,3,4} with period 24; sequence gives position of bell 4 (the tenor bell) in n-th permutation.A090284
"Plain Bob Minimus" in bell-ringing is a sequence of permutations p_1=(1,2,3,4), p_2=(2,1,4,3), .. which runs through all permutations of {1,2,3,4} with period 24; sequence gives position of bell 4 (the tenor bell) in n-th permutation.
- Triangle T(n,k), 0<=k<=n, read by rows, defined by: T(n,k)=0 if k>n, T(n,0) = A000108(n); T(n+1,k)= Sum_{j=0..n} T(n-j,k-1)*binomial(2j+1,j+1).A090285
Triangle T(n,k), 0<=k<=n, read by rows, defined by: T(n,k)=0 if k>n, T(n,0) = A000108(n); T(n+1,k)= Sum_{j=0..n} T(n-j,k-1)*binomial(2j+1,j+1).
- Median term of prime 5-tuples (p, p+2, p+6, p+8, p+12).A090286
Median term of prime 5-tuples (p, p+2, p+6, p+8, p+12).
- Smallest prime obtained by sandwiching n between a number with identical digits, or 0 if no such prime exists. Primes of the form k n k where all the digits of k are identical.A090287
Smallest prime obtained by sandwiching n between a number with identical digits, or 0 if no such prime exists. Primes of the form k n k where all the digits of k are identical.
- a(n) = 2*n^2 + 6*n + 2.A090288
a(n) = 2*n^2 + 6*n + 2.
- Smallest prime of the form 10^k - prime(n), or 0 if no such prime exists.A090289
Smallest prime of the form 10^k - prime(n), or 0 if no such prime exists.
- Value of k pertaining to A090289, or 0 if A090289(n) = 0.A090290
Value of k pertaining to A090289, or 0 if A090289(n) = 0.
- Index of first occurrence of n in A090290, or 0 if n does not occur in A090290.A090291
Index of first occurrence of n in A090290, or 0 if n does not occur in A090290.
- Least square k^2 > n^2 whose decimal expansion ends in n^2.A090292
Least square k^2 > n^2 whose decimal expansion ends in n^2.
- Least k > n such that the decimal expansion of k^2 ends in n^2.A090293
Least k > n such that the decimal expansion of k^2 ends in n^2.
- a(n) = K_3(n) = Sum_{k>=0} A090285(3,k)*2^k*binomial(n,k). a(n) = (4*n^3+30*n^2+56*n+15)/3.A090294
a(n) = K_3(n) = Sum_{k>=0} A090285(3,k)*2^k*binomial(n,k). a(n) = (4*n^3+30*n^2+56*n+15)/3.
- Let f(0) = 0, f(1) = 1 and for n > 1 let f(n) = (-1)*sum((-1)^(n+r)*f(r),r=0..n-2)/(n*(n-1)); sequence gives numerator of f(n).A090295
Let f(0) = 0, f(1) = 1 and for n > 1 let f(n) = (-1)*sum((-1)^(n+r)*f(r),r=0..n-2)/(n*(n-1)); sequence gives numerator of f(n).
- a(n) = K_4(n) = Sum_{k>=0} A090285(4,k)*2^k*binomial(n,k). a(n) = 2*(n^4+14*n^3+62*n^2+91*n+21)/3.A090296
a(n) = K_4(n) = Sum_{k>=0} A090285(4,k)*2^k*binomial(n,k). a(n) = 2*(n^4+14*n^3+62*n^2+91*n+21)/3.
- a(n) = K_5(n) = Sum_{k>=0} A090285(5,k)*2^k*binomial(n,k). a(n) = 2*(2*n^5+45*n^4+360*n^3+1215*n^2+1528*n+315)/15.A090297
a(n) = K_5(n) = Sum_{k>=0} A090285(5,k)*2^k*binomial(n,k). a(n) = 2*(2*n^5+45*n^4+360*n^3+1215*n^2+1528*n+315)/15.
- Permutation of natural numbers generated by 5-row array shown below.A090298
Permutation of natural numbers generated by 5-row array shown below.
- Table T(n,k), n>=0 and k>=0, read by antidiagonals : the k-th column given by the k-th polynomial K_k related to A090285.A090299
Table T(n,k), n>=0 and k>=0, read by antidiagonals : the k-th column given by the k-th polynomial K_k related to A090285.
- a(n) = 14*a(n-1) + a(n-2), starting with a(0) = 2 and a(1) = 14.A090300
a(n) = 14*a(n-1) + a(n-2), starting with a(0) = 2 and a(1) = 14.
- a(n) = 15*a(n-1) + a(n-2), starting with a(0) = 2 and a(1) = 15.A090301
a(n) = 15*a(n-1) + a(n-2), starting with a(0) = 2 and a(1) = 15.
- Begin with n and consider numbers obtained by successively subtracting 0, 1, 2, 3, ...; a(n) = largest prime that arises in the process, i.e., largest prime of the form n - T(r), where T(r) is the r-th triangular number; or 0 if no such number exists.A090302
Begin with n and consider numbers obtained by successively subtracting 0, 1, 2, 3, ...; a(n) = largest prime that arises in the process, i.e., largest prime of the form n - T(r), where T(r) is the r-th triangular number; or 0 if no such number exists.
- Begin with n and consider numbers obtained by successively subtracting 2,3,5,7,11,...; a(n) = largest prime that arises, i.e., largest prime of the form n - sum prime(r), or 0 if no such prime exists.A090303
Begin with n and consider numbers obtained by successively subtracting 2,3,5,7,11,...; a(n) = largest prime that arises, i.e., largest prime of the form n - sum prime(r), or 0 if no such prime exists.
- Indices of 0's in A090303.A090304
Indices of 0's in A090303.
- a(n) = 16*a(n-1) + a(n-2), starting with a(0) = 2 and a(1) = 16.A090305
a(n) = 16*a(n-1) + a(n-2), starting with a(0) = 2 and a(1) = 16.
- a(n) = 17*a(n-1) + a(n-2), starting with a(0) = 2 and a(1) = 17.A090306
a(n) = 17*a(n-1) + a(n-2), starting with a(0) = 2 and a(1) = 17.
- a(n) = 18*a(n-1) + a(n-2), starting with a(0) = 2 and a(1) = 18.A090307
a(n) = 18*a(n-1) + a(n-2), starting with a(0) = 2 and a(1) = 18.
- a(n) = 19*a(n-1) + a(n-2), starting with a(0) = 2 and a(1) = 19.A090308
a(n) = 19*a(n-1) + a(n-2), starting with a(0) = 2 and a(1) = 19.
- a(n) = 20*a(n-1) + a(n-2), starting with a(0) = 2 and a(1) = 20.A090309
a(n) = 20*a(n-1) + a(n-2), starting with a(0) = 2 and a(1) = 20.
- a(n) = 21*a(n-1) + a(n-2), starting with a(0) = 2 and a(1) = 21.A090310
a(n) = 21*a(n-1) + a(n-2), starting with a(0) = 2 and a(1) = 21.