Sequences
392,541 sequences
- a(1) = 9; a(n) = smallest number such that the juxtaposition a(1)a(2)...a(n) is a prime.A069611
a(1) = 9; a(n) = smallest number such that the juxtaposition a(1)a(2)...a(n) is a prime.
- a(1) = 19 (the smallest prime ending in a 9) and a(n+1) = smallest prime ending in a(n).A069612
a(1) = 19 (the smallest prime ending in a 9) and a(n+1) = smallest prime ending in a(n).
- a(1) = 1; a(2n) is smallest prime starting with a(2n-1) and a number with no insignificant zeros, and a(2n+1) is smallest prime ending in a(2n-1). Alternate left and right concatenation yielding primes.A069613
a(1) = 1; a(2n) is smallest prime starting with a(2n-1) and a number with no insignificant zeros, and a(2n+1) is smallest prime ending in a(2n-1). Alternate left and right concatenation yielding primes.
- a(1) = 2; a(2n) = smallest prime starting (the most significant digits) with a(2n-1) (i.e., as a right concatenation of a(2n-1) and a number with no insignificant zeros); a(2n+1) = smallest prime ending in (the least significant digits) a(2n-1). Alternate left and right concatenation yielding primes.A069614
a(1) = 2; a(2n) = smallest prime starting (the most significant digits) with a(2n-1) (i.e., as a right concatenation of a(2n-1) and a number with no insignificant zeros); a(2n+1) = smallest prime ending in (the least significant digits) a(2n-1). Alternate left and right concatenation yielding primes.
- a(1) = 3; a(2n) = smallest prime starting (in the most significant digits) with a(2n-1) (i.e., as a right concatenation of a(2n-1) and a number with no insignificant zeros); a(2n+1) = smallest prime ending in (the least significant digits) a(2n-1). Alternate left and right concatenation yielding primes.A069615
a(1) = 3; a(2n) = smallest prime starting (in the most significant digits) with a(2n-1) (i.e., as a right concatenation of a(2n-1) and a number with no insignificant zeros); a(2n+1) = smallest prime ending in (the least significant digits) a(2n-1). Alternate left and right concatenation yielding primes.
- a(1) = 4; a(2n) = smallest prime that is a right concatenation of a(2n-1) and a number with no insignificant zeros and a(2n+1) = smallest prime ending in ( the least significant digits) a(2n-1). Alternate left and right concatenation yielding primes.A069616
a(1) = 4; a(2n) = smallest prime that is a right concatenation of a(2n-1) and a number with no insignificant zeros and a(2n+1) = smallest prime ending in ( the least significant digits) a(2n-1). Alternate left and right concatenation yielding primes.
- a(1) = 5; a(2n) = smallest prime that is a right concatenation of a(2n-1) and a number with no insignificant zeros and a(2n+1) = smallest prime ending in ( the least significant digits) a(2n-1). Alternate left and right concatenation yielding primes.A069617
a(1) = 5; a(2n) = smallest prime that is a right concatenation of a(2n-1) and a number with no insignificant zeros and a(2n+1) = smallest prime ending in ( the least significant digits) a(2n-1). Alternate left and right concatenation yielding primes.
- a(1) = 6; a(2n) = smallest prime that is a right concatenation of a(2n-1) and a number with no insignificant zeros and a(2n+1) = smallest prime ending in ( the least significant digits) a(2n-1). Alternate left and right concatenation yielding primes.A069618
a(1) = 6; a(2n) = smallest prime that is a right concatenation of a(2n-1) and a number with no insignificant zeros and a(2n+1) = smallest prime ending in ( the least significant digits) a(2n-1). Alternate left and right concatenation yielding primes.
- a(1) = 7; a(2n) = smallest prime that is a right concatenation of a(2n-1) and a number with no insignificant zeros and a(2n+1) = smallest prime ending in ( the least significant digits) a(2n-1). Alternate left and right concatenation yielding primes.A069619
a(1) = 7; a(2n) = smallest prime that is a right concatenation of a(2n-1) and a number with no insignificant zeros and a(2n+1) = smallest prime ending in ( the least significant digits) a(2n-1). Alternate left and right concatenation yielding primes.
- a(1) = 8; a(2n) = smallest prime that is a right concatenation of a(2n-1) and a number with no insignificant zeros and a(2n+1) = smallest prime ending in ( the least significant digits) a(2n-1). Alternate left and right concatenation yielding primes.A069620
a(1) = 8; a(2n) = smallest prime that is a right concatenation of a(2n-1) and a number with no insignificant zeros and a(2n+1) = smallest prime ending in ( the least significant digits) a(2n-1). Alternate left and right concatenation yielding primes.
- a(1) = 9; a(2n) = smallest prime that is a right concatenation of a(2n-1) and a number with no insignificant zeros and a(2n+1) = smallest prime ending in ( the least significant digits) a(2n). Alternate left and right concatenation yielding primes.A069621
a(1) = 9; a(2n) = smallest prime that is a right concatenation of a(2n-1) and a number with no insignificant zeros and a(2n+1) = smallest prime ending in ( the least significant digits) a(2n). Alternate left and right concatenation yielding primes.
- Let Power(n) be the sequence of integer roots or powers of n. Power(1) is 1,1,1,1,... Power(4) is 1,2,4,16,64,256,... Power(27) is 1,3,9,27,729,... Power (p^k) is 1,p,p^a,p^b,...p^k, p^2k,p^3k,...where p is a prime and a,b etc. are divisors of k. This is the sequence of the n-th term of Power(n).A069622
Let Power(n) be the sequence of integer roots or powers of n. Power(1) is 1,1,1,1,... Power(4) is 1,2,4,16,64,256,... Power(27) is 1,3,9,27,729,... Power (p^k) is 1,p,p^a,p^b,...p^k, p^2k,p^3k,...where p is a prime and a,b etc. are divisors of k. This is the sequence of the n-th term of Power(n).
- Number of perfect powers <= n.A069623
Number of perfect powers <= n.
- Number of different values taken by the integer part of n^(1/k) for all k > 1.A069624
Number of different values taken by the integer part of n^(1/k) for all k > 1.
- Number of distinct numbers that can be formed as a product of two or more divisors of n.A069625
Number of distinct numbers that can be formed as a product of two or more divisors of n.
- Number of sets of integers larger than one whose least common multiple is n.A069626
Number of sets of integers larger than one whose least common multiple is n.
- Sum_{k=1..n} floor(n*(n-1)/(2*k)).A069627
Sum_{k=1..n} floor(n*(n-1)/(2*k)).
- a(1) = 1; a(2n) = smallest prime starting (most significant digits) with a(2n-1). a(2n+1) = smallest prime ending (least significant digits) in a(2n).A069628
a(1) = 1; a(2n) = smallest prime starting (most significant digits) with a(2n-1). a(2n+1) = smallest prime ending (least significant digits) in a(2n).
- a(1) = 2; a(2n) = smallest prime starting (most significant digits) with a(2n-1). a(2n+1) = smallest prime ending (least significant digits)in a(2n).A069629
a(1) = 2; a(2n) = smallest prime starting (most significant digits) with a(2n-1). a(2n+1) = smallest prime ending (least significant digits)in a(2n).
- a(1) = 3; a(2n) = smallest prime starting (most significant digits) with a(2n-1). a(2n+1) = smallest prime ending (least significant digits)in a(2n).A069630
a(1) = 3; a(2n) = smallest prime starting (most significant digits) with a(2n-1). a(2n+1) = smallest prime ending (least significant digits)in a(2n).
- a(1) = 4; a(2n) = smallest prime starting (most significant digits) with a(2n-1). a(2n+1) = smallest prime ending (least significant digits)in a(2n).A069631
a(1) = 4; a(2n) = smallest prime starting (most significant digits) with a(2n-1). a(2n+1) = smallest prime ending (least significant digits)in a(2n).
- a(1) = 5; a(2n) = smallest prime starting (most significant digits) with a(2n-1). a(2n+1) = smallest prime ending (least significant digits)in a(2n).A069632
a(1) = 5; a(2n) = smallest prime starting (most significant digits) with a(2n-1). a(2n+1) = smallest prime ending (least significant digits)in a(2n).
- a(1) = 6; a(2n) = smallest prime starting (most significant digits) with a(2n-1). a(2n+1) = smallest prime ending (least significant digits)in a(2n).A069633
a(1) = 6; a(2n) = smallest prime starting (most significant digits) with a(2n-1). a(2n+1) = smallest prime ending (least significant digits)in a(2n).
- a(1) = 7; a(2n) = smallest prime starting (most significant digits) with a(2n-1). a(2n+1) = smallest prime ending (least significant digits)in a(2n).A069634
a(1) = 7; a(2n) = smallest prime starting (most significant digits) with a(2n-1). a(2n+1) = smallest prime ending (least significant digits)in a(2n).
- a(1) = 8; a(2n) = smallest prime starting (most significant digits) with a(2n-1). a(2n+1) = smallest prime ending (least significant digits)in a(2n).A069635
a(1) = 8; a(2n) = smallest prime starting (most significant digits) with a(2n-1). a(2n+1) = smallest prime ending (least significant digits)in a(2n).
- a(1) = 9; a(2n) = smallest prime starting (most significant digits) with a(2n-1). a(2n+1) = smallest prime ending (least significant digits)in a(2n).A069636
a(1) = 9; a(2n) = smallest prime starting (most significant digits) with a(2n-1). a(2n+1) = smallest prime ending (least significant digits)in a(2n).
- Number of prime powers <= n with exponents > 1.A069637
Number of prime powers <= n with exponents > 1.
- "Sorted" sum of two previous terms, beginning with 0,1. "Sorted" means to sort the digits of the sum in ascending order.A069638
"Sorted" sum of two previous terms, beginning with 0,1. "Sorted" means to sort the digits of the sum in ascending order.
- Smallest composite k such that phi(k) > k*(1-1/n^2).A069639
Smallest composite k such that phi(k) > k*(1-1/n^2).
- Let M_n be the n X n matrix with M_n(i,j)=1/(i+j+1); then a(n)=1/det(M_n).A069640
Let M_n be the n X n matrix with M_n(i,j)=1/(i+j+1); then a(n)=1/det(M_n).
- Let M_n be the n X n matrix with M_n(i,j)=1/(i+j+2); then a(n)=1/det(M_n).A069641
Let M_n be the n X n matrix with M_n(i,j)=1/(i+j+2); then a(n)=1/det(M_n).
- Let M_n be the n X n matrix with M_n(i,j)=1/(i+j+3); then a(n)=1/det(M_n).A069642
Let M_n be the n X n matrix with M_n(i,j)=1/(i+j+3); then a(n)=1/det(M_n).
- Let M_n be the n X n matrix with M_n(i,j)=1/(i+j+4); then a(n)=1/det(M_n).A069643
Let M_n be the n X n matrix with M_n(i,j)=1/(i+j+4); then a(n)=1/det(M_n).
- Let M_n be the n X n matrix with M_n(i,j)=1/(i+j+5); then a(n)=1/det(M_n).A069644
Let M_n be the n X n matrix with M_n(i,j)=1/(i+j+5); then a(n)=1/det(M_n).
- Define sds(n) = sum of the squares of the digits of n. Sequence gives smaller of two consecutive squares with sds(k^2) = sds((k+1)^2).A069645
Define sds(n) = sum of the squares of the digits of n. Sequence gives smaller of two consecutive squares with sds(k^2) = sds((k+1)^2).
- Weight distribution of [97,49,15] binary quadratic-residue (or QR) code.A069646
Weight distribution of [97,49,15] binary quadratic-residue (or QR) code.
- a(1) = 1; for n > 1, the smallest n-th power with the digit sum also a nontrivial n-th power, i.e., 10^n is not a member.A069647
a(1) = 1; for n > 1, the smallest n-th power with the digit sum also a nontrivial n-th power, i.e., 10^n is not a member.
- a(1) = 1, otherwise smallest m > 1 such that the sum of digits of m^n is k^n for some k > 1.A069648
a(1) = 1, otherwise smallest m > 1 such that the sum of digits of m^n is k^n for some k > 1.
- Let M_n be the n X n matrix with M_n(i,j)=i^3/(i+j); then a(n)=1/det(M_n).A069649
Let M_n be the n X n matrix with M_n(i,j)=i^3/(i+j); then a(n)=1/det(M_n).
- Largest n-digit number with maximal number of divisors.A069650
Largest n-digit number with maximal number of divisors.
- For n >= 1, let M_n be the n X n matrix with M_n(i,j) = i^2/(i+j); then a(n) = 1/det(M_n). Also, a(0) = 1 by convention.A069651
For n >= 1, let M_n be the n X n matrix with M_n(i,j) = i^2/(i+j); then a(n) = 1/det(M_n). Also, a(0) = 1 by convention.
- GCD of all the numbers obtained by permuting the digits of n.A069652
GCD of all the numbers obtained by permuting the digits of n.
- Smallest n-digit number with only prime divisors 2 or 3 (i.e., of the form 2^a * 3^b).A069653
Smallest n-digit number with only prime divisors 2 or 3 (i.e., of the form 2^a * 3^b).
- a(1) = 1; for n > 1, a(n) = smallest number > a(n-1) having exactly n divisors.A069654
a(1) = 1; for n > 1, a(n) = smallest number > a(n-1) having exactly n divisors.
- Maximum element in the simple continued fraction expansion for (1+1/n)^n.A069655
Maximum element in the simple continued fraction expansion for (1+1/n)^n.
- Perfect powers that can be permuted into another perfect power (in base 10).A069656
Perfect powers that can be permuted into another perfect power (in base 10).
- Sum( S(n,k) * M(k-1), k=1..n), where S(n,k) = Stirling numbers of the second kind, M(n) = Motzkin numbers, A001006.A069657
Sum( S(n,k) * M(k-1), k=1..n), where S(n,k) = Stirling numbers of the second kind, M(n) = Motzkin numbers, A001006.
- a(1) = 1; a(n) = smallest nontrivial n-digit perfect power.A069658
a(1) = 1; a(n) = smallest nontrivial n-digit perfect power.
- Largest n-digit perfect power.A069659
Largest n-digit perfect power.
- Order of the subgroup of the symmetric group S_n generated by the cycles (1,3) and (1,2,3,...,n).A069660
Order of the subgroup of the symmetric group S_n generated by the cycles (1,3) and (1,2,3,...,n).