Sequences
392,541 sequences
- Concatenations arising in A089560.A089561
Concatenations arising in A089560.
- a(1) = 7. For n > 1, a(n) is the least unused number such that every concatenation a(n)a(n-1)...a(2)a(1) is prime.A089562
a(1) = 7. For n > 1, a(n) is the least unused number such that every concatenation a(n)a(n-1)...a(2)a(1) is prime.
- Primes arising in A089562.A089563
Primes arising in A089562.
- a(1) = 9. For n > 1, a(n) is the least unused number such that the decimal concatenation a(n)a(n-1)...a(2)a(1) is prime.A089564
a(1) = 9. For n > 1, a(n) is the least unused number such that the decimal concatenation a(n)a(n-1)...a(2)a(1) is prime.
- Concatenations arising in A089564.A089565
Concatenations arising in A089564.
- a(1) = 11. For n > 1, a(n) is the least unused number such that every concatenation a(n)a(n-1)...a(2)a(1) is prime.A089566
a(1) = 11. For n > 1, a(n) is the least unused number such that every concatenation a(n)a(n-1)...a(2)a(1) is prime.
- Primes arising in A089566.A089567
Primes arising in A089566.
- a(1) = 13. For n > 1, a(n) is the least unused number such that every concatenation a(n)a(n-1)...a(2)a(1) is prime.A089568
a(1) = 13. For n > 1, a(n) is the least unused number such that every concatenation a(n)a(n-1)...a(2)a(1) is prime.
- Primes arising in A089568.A089569
Primes arising in A089568.
- a(1) = 17. For n > 1, a(n) is the least unused number such that every concatenation a(n)a(n-1)...a(2)a(1) is prime.A089570
a(1) = 17. For n > 1, a(n) is the least unused number such that every concatenation a(n)a(n-1)...a(2)a(1) is prime.
- Primes arising in A089570.A089571
Primes arising in A089570.
- a(1) = 19. For n > 1, a(n) is the least unused number such that every concatenation a(n)a(n-1)...a(2)a(1) is prime.A089572
a(1) = 19. For n > 1, a(n) is the least unused number such that every concatenation a(n)a(n-1)...a(2)a(1) is prime.
- Primes arising in A089572.A089573
Primes arising in A089572.
- Column 4 of an array closely related to A083480. (Both arrays have shape sequence A083479).A089574
Column 4 of an array closely related to A083480. (Both arrays have shape sequence A083479).
- Let f(k^n) = m where m is the largest power of k+1 < k^n. a(n) = number of iterations of f to reach 1, starting from n and starting from k = 2.A089575
Let f(k^n) = m where m is the largest power of k+1 < k^n. a(n) = number of iterations of f to reach 1, starting from n and starting from k = 2.
- Let p_k = k-th prime, let f((p_k)^n) = m where m is the largest power of p_(k+1) < (p_k)^n. a(n) = number of iterations of f to reach 1, starting from n and starting from k = 1.A089576
Let p_k = k-th prime, let f((p_k)^n) = m where m is the largest power of p_(k+1) < (p_k)^n. a(n) = number of iterations of f to reach 1, starting from n and starting from k = 1.
- a(n) = r-th prime of the form (p-q)/(q-r) with r=prime(n+1), q=prime(n+2), and primes p > q.A089577
a(n) = r-th prime of the form (p-q)/(q-r) with r=prime(n+1), q=prime(n+2), and primes p > q.
- Decimal expansion of 2^20996011 - 1, the 40th Mersenne prime A000668(40).A089578
Decimal expansion of 2^20996011 - 1, the 40th Mersenne prime A000668(40).
- Total number of perfect powers > 1 below 10^n.A089579
Total number of perfect powers > 1 below 10^n.
- Total number of perfect powers > 1 below 10^n, counting multiple representations separately.A089580
Total number of perfect powers > 1 below 10^n, counting multiple representations separately.
- a(n) = prime(2*n-1)*prime(2*n).A089581
a(n) = prime(2*n-1)*prime(2*n).
- From Gilbreath's conjecture.A089582
From Gilbreath's conjecture.
- Numbers n which are a multiple of A068505(n) (= n read in base m+1 where m = largest digit of n).A089583
Numbers n which are a multiple of A068505(n) (= n read in base m+1 where m = largest digit of n).
- Numbers n which are a proper multiple (>1) of A068505(n) (= n read in base m+1 where m = largest digit of n).A089584
Numbers n which are a proper multiple (>1) of A068505(n) (= n read in base m+1 where m = largest digit of n).
- Records in A005589.A089585
Records in A005589.
- Number of arborescent (stellar-rational or prysmatic-rational) knots and links.A089586
Number of arborescent (stellar-rational or prysmatic-rational) knots and links.
- a(n) is the smallest integer k, 0<k<n, that most often satisfies the condition: k^m > k^(m+1) (modulo n) as m varies from 1 to n-1, for n>2, with a(1)=0 and a(2)=1.A089587
a(n) is the smallest integer k, 0<k<n, that most often satisfies the condition: k^m > k^(m+1) (modulo n) as m varies from 1 to n-1, for n>2, with a(1)=0 and a(2)=1.
- a(n) = A089587(2^n+1) for n >= 0.A089588
a(n) = A089587(2^n+1) for n >= 0.
- Iban numbers (the letter i is banned from the English name of the number).A089589
Iban numbers (the letter i is banned from the English name of the number).
- Uban numbers (the letter u is banned from the English name of the number).A089590
Uban numbers (the letter u is banned from the English name of the number).
- "Lazy binary" representation of n. Also called redundant binary representation of n.A089591
"Lazy binary" representation of n. Also called redundant binary representation of n.
- For any prime p, define a sequence S_p: S_p(1) = p and S_p(n+1) is the least prime > S_p(n) that begins with the last digit of S_p(n). Let f(p) be the first member of S_p that is the digit reversal of the previous member. Sequence contains primes p that such that f(p) does not equal f(q) for any q < p.A089592
For any prime p, define a sequence S_p: S_p(1) = p and S_p(n+1) is the least prime > S_p(n) that begins with the last digit of S_p(n). Let f(p) be the first member of S_p that is the digit reversal of the previous member. Sequence contains primes p that such that f(p) does not equal f(q) for any q < p.
- Numbers k such that k^2 + 2k + 2 is prime.A089593
Numbers k such that k^2 + 2k + 2 is prime.
- Alternating sum of squares to n.A089594
Alternating sum of squares to n.
- Table T(n,k), n>=0 and k>=0: Stern's diatomic array read by antidiagonals (version 5).A089595
Table T(n,k), n>=0 and k>=0: Stern's diatomic array read by antidiagonals (version 5).
- G.f.: (1+2*x^3+3*x^6+x^8+6*x^9+2*x^11+9*x^12+x^14+10*x^15+x^16+9*x^18+2*x^19 +6*x^21 +x^22+3*x^24+2*x^27+x^30) / ((1-x^5)^2*(1-x^12)^2).A089596
G.f.: (1+2*x^3+3*x^6+x^8+6*x^9+2*x^11+9*x^12+x^14+10*x^15+x^16+9*x^18+2*x^19 +6*x^21 +x^22+3*x^24+2*x^27+x^30) / ((1-x^5)^2*(1-x^12)^2).
- G.f.: (1+x)*(1+x^3)*(1+x^5)*(1+x^7)/((1-x^2)*(1-x^4)*(1-x^6)*(1-x^8)).A089597
G.f.: (1+x)*(1+x^3)*(1+x^5)*(1+x^7)/((1-x^2)*(1-x^4)*(1-x^6)*(1-x^8)).
- G.f.: (1+x^2+x^3)/(1-x^3)^2.A089598
G.f.: (1+x^2+x^3)/(1-x^3)^2.
- G.f.: (1+x^5+x^7+x^8+x^10+x^15)/((1-x^2)(1-x^3)(1-x^4)(1-x^6)^2(1-x^9)).A089599
G.f.: (1+x^5+x^7+x^8+x^10+x^15)/((1-x^2)(1-x^3)(1-x^4)(1-x^6)^2(1-x^9)).
- Another lazy binary representation of n: similar to A089591 except that the single carry is performed before the increment instead of after.A089600
Another lazy binary representation of n: similar to A089591 except that the single carry is performed before the increment instead of after.
- Interleaving of A089591 and A089600.A089601
Interleaving of A089591 and A089600.
- Expansion of L(x)^(1/4), where L(x) = o.g.f. for A053175.A089602
Expansion of L(x)^(1/4), where L(x) = o.g.f. for A053175.
- G.f.: sqrt(1/agm(1, 1-8*x)) = sqrt(o.g.f. for A081085).A089603
G.f.: sqrt(1/agm(1, 1-8*x)) = sqrt(o.g.f. for A081085).
- "3-lazy binary" representation of n: to increment, add one to the last digit, then "carry" the rightmost 3 (replace 03->11, 13->21, or 23->31).A089604
"3-lazy binary" representation of n: to increment, add one to the last digit, then "carry" the rightmost 3 (replace 03->11, 13->21, or 23->31).
- Let P(m) = m/2 if m is even, m + rev(m) if m is odd, where rev(m) is m's base 10 representation reversed. It is conjectured that any number k eventually cycles when P is repeatedly applied to it. Sequence gives number of steps before the cycle is reached.A089605
Let P(m) = m/2 if m is even, m + rev(m) if m is odd, where rev(m) is m's base 10 representation reversed. It is conjectured that any number k eventually cycles when P is repeatedly applied to it. Sequence gives number of steps before the cycle is reached.
- Table T(n,k), n>=1 and k>=1; the k-th row is defined by :partial sums of the sequence 1, a(1), .., a(1), a(2), .., a(2), a(3), ..,a(3), a(4), ... each term repeated k times (with a(i)= T(i,k)).A089606
Table T(n,k), n>=1 and k>=1; the k-th row is defined by :partial sums of the sequence 1, a(1), .., a(1), a(2), .., a(2), a(3), ..,a(3), a(4), ... each term repeated k times (with a(i)= T(i,k)).
- a(n)=((-1)^(n+1)*A002425(n)) modulo 4.A089607
a(n)=((-1)^(n+1)*A002425(n)) modulo 4.
- a(n) = ((-1)^(n+1)*A002425(n)) modulo 6.A089608
a(n) = ((-1)^(n+1)*A002425(n)) modulo 6.
- Prime number of primes between squares of consecutive primes; or, primes occurring in A050216.A089609
Prime number of primes between squares of consecutive primes; or, primes occurring in A050216.
- Number of primes between n^2 and (n+1/2)^2.A089610
Number of primes between n^2 and (n+1/2)^2.