Sequences
392,541 sequences
- a(n) = Sum_{k=1..n} T(n,k) / (k * (n-k+1)) where T is given in A080046.A082611
a(n) = Sum_{k=1..n} T(n,k) / (k * (n-k+1)) where T is given in A080046.
- Numbers n such that ((n-1)^2+1)/2 and n^2+1 and ((n+1)^2+1)/2 are prime if n is even or (n-1)^2+1 and (n^2+1)/2 and (n+1)^2+1 are prime if n is odd.A082612
Numbers n such that ((n-1)^2+1)/2 and n^2+1 and ((n+1)^2+1)/2 are prime if n is even or (n-1)^2+1 and (n^2+1)/2 and (n+1)^2+1 are prime if n is odd.
- Smallest palindrome divisible by an n-th power.A082613
Smallest palindrome divisible by an n-th power.
- a(n) = A082613(n) divided by the n-th power that divides it.A082614
a(n) = A082613(n) divided by the n-th power that divides it.
- Palindromes such that the GCD of any pair of successive terms is a palindromic prime.A082615
Palindromes such that the GCD of any pair of successive terms is a palindromic prime.
- Palindromes such that the least common multiple of any pair of successive terms is a palindrome.A082616
Palindromes such that the least common multiple of any pair of successive terms is a palindrome.
- a(1) = 1, then squarefree palindromes such that a(n+1) = p*a(n) where p is a prime not dividing any previous term.A082617
a(1) = 1, then squarefree palindromes such that a(n+1) = p*a(n) where p is a prime not dividing any previous term.
- Primes pertaining to A082617. a(n) = A082617(n+1)/A082617(n).A082618
Primes pertaining to A082617. a(n) = A082617(n+1)/A082617(n).
- Duplicate of A046399.A082619
Duplicate of A046399.
- a(1) = 1, then the smallest palindromic prime obtained by inserting digits anywhere in a(n-1).A082620
a(1) = 1, then the smallest palindromic prime obtained by inserting digits anywhere in a(n-1).
- a(1) = 2, then the smallest palindromic prime obtained by inserting digits anywhere in a(n-1) (including at the ends).A082621
a(1) = 2, then the smallest palindromic prime obtained by inserting digits anywhere in a(n-1) (including at the ends).
- a(1) = 3, a(n) = smallest palindromic prime obtained by inserting two paired digits anywhere in a(n-1).A082622
a(1) = 3, a(n) = smallest palindromic prime obtained by inserting two paired digits anywhere in a(n-1).
- a(1) = 5, a(n) = smallest palindromic prime obtained by inserting two digits anywhere in a(n-1).A082623
a(1) = 5, a(n) = smallest palindromic prime obtained by inserting two digits anywhere in a(n-1).
- a(1) = 7, a(n) = smallest palindromic prime obtained by inserting digit anywhere in a(n-1).A082624
a(1) = 7, a(n) = smallest palindromic prime obtained by inserting digit anywhere in a(n-1).
- Smallest palindromic prime that ends (on the least significant side) in prime(n).A082625
Smallest palindromic prime that ends (on the least significant side) in prime(n).
- Smallest palindromic prime that ends (the least significant side) in (2n-1) the n-th odd number, or 0 if no such number exists, e.g., for 2n-1 = 10k + 5, k>0.A082626
Smallest palindromic prime that ends (the least significant side) in (2n-1) the n-th odd number, or 0 if no such number exists, e.g., for 2n-1 = 10k + 5, k>0.
- Duplicate of A028888.A082627
Duplicate of A028888.
- Duplicate of A028978.A082628
Duplicate of A028978.
- Duplicate of A028979.A082629
Duplicate of A028979.
- Limit of the sequence obtained from S(0) = (1,1) and, for n > 0, S(n) = I(S(n-1)), where I consists of inserting, for i = 1, 2, 3..., the term a(i) + a(i+1) between any two terms for which 7*a(i+1) <= 11*a(i).A082630
Limit of the sequence obtained from S(0) = (1,1) and, for n > 0, S(n) = I(S(n-1)), where I consists of inserting, for i = 1, 2, 3..., the term a(i) + a(i+1) between any two terms for which 7*a(i+1) <= 11*a(i).
- Enumeration of fractal 321 avoiders.A082631
Enumeration of fractal 321 avoiders.
- Decimal expansion of lim_{y->infinity} y^2*(Re(zeta(1 + i/y)) - gamma).A082632
Decimal expansion of lim_{y->infinity} y^2*(Re(zeta(1 + i/y)) - gamma).
- Decimal expansion of the 1st Stieltjes constant gamma_1 (negated).A082633
Decimal expansion of the 1st Stieltjes constant gamma_1 (negated).
- Numbers n which can be expressed as sum of d consecutive primes (where d>0 is a divisor of n).A082634
Numbers n which can be expressed as sum of d consecutive primes (where d>0 is a divisor of n).
- Square array read by antidiagonals: degree of the K(2,p)^q variety.A082635
Square array read by antidiagonals: degree of the K(2,p)^q variety.
- a(n) = smallest number which can be expressed as sum of d consecutive primes in exactly n ways (where d>0 is a divisor of the number).A082636
a(n) = smallest number which can be expressed as sum of d consecutive primes in exactly n ways (where d>0 is a divisor of the number).
- a(n) = smallest number which can be expressed as sum of d consecutive positive integers in exactly n ways (where d>0 is a divisor of the number).A082637
a(n) = smallest number which can be expressed as sum of d consecutive positive integers in exactly n ways (where d>0 is a divisor of the number).
- A077388 sorted and duplicates removed.A082638
A077388 sorted and duplicates removed.
- Numbers k such that 2*k*(k+2) is a square.A082639
Numbers k such that 2*k*(k+2) is a square.
- Triangle T(m,n) read by rows: unimodular triangulations of the grid P(m,n), m,n > 0, n <= m.A082640
Triangle T(m,n) read by rows: unimodular triangulations of the grid P(m,n), m,n > 0, n <= m.
- Triangle T(n,k) (n >= 1, 1 <= k <= n) read by rows, where T(n,k) = number of basic invariants of degree k for the cyclic group of order and degree n.A082641
Triangle T(n,k) (n >= 1, 1 <= k <= n) read by rows, where T(n,k) = number of basic invariants of degree k for the cyclic group of order and degree n.
- Expansion of Molien series for 5-dimensional representation of dihedral group of order 10.A082642
Expansion of Molien series for 5-dimensional representation of dihedral group of order 10.
- a(n) = ceiling(n*(n+1/2)/2).A082643
a(n) = ceiling(n*(n+1/2)/2).
- a(n) = floor(n*(n-1/2)/2).A082644
a(n) = floor(n*(n-1/2)/2).
- a(n) = floor((2*n^2 + n - 4)/4).A082645
a(n) = floor((2*n^2 + n - 4)/4).
- Primes whose decimal expansions contain equal numbers of each of their digits.A082646
Primes whose decimal expansions contain equal numbers of each of their digits.
- Number of ways n can be expressed as the sum of d consecutive positive integers where d>0 is a divisor of n.A082647
Number of ways n can be expressed as the sum of d consecutive positive integers where d>0 is a divisor of n.
- Consider f(m) = Sum_{k=1..m} k! (A007489) when m is very large; a(n) = n-th digit from end.A082648
Consider f(m) = Sum_{k=1..m} k! (A007489) when m is very large; a(n) = n-th digit from end.
- Triangle of coefficients in expansion of sinh^2(n*x) in powers of sinh(x).A082649
Triangle of coefficients in expansion of sinh^2(n*x) in powers of sinh(x).
- Number of primes < n of form 1+k*spf(n), where spf(n) is the smallest prime factor of n (A020639).A082650
Number of primes < n of form 1+k*spf(n), where spf(n) is the smallest prime factor of n (A020639).
- Positive integer values of n such that 5n^2+11 is a square.A082651
Positive integer values of n such that 5n^2+11 is a square.
- Triangle read by rows: T(n,k) is the number of squares that can be found in a k X n rectangular grid of little squares, for 1 <= k <= n.A082652
Triangle read by rows: T(n,k) is the number of squares that can be found in a k X n rectangular grid of little squares, for 1 <= k <= n.
- For smallest numbers k such that A082596(k) = n, sequence gives A060863(k).A082653
For smallest numbers k such that A082596(k) = n, sequence gives A060863(k).
- Order of 4 mod n-th prime: least k such that prime(n) divides 4^k-1, n >= 2.A082654
Order of 4 mod n-th prime: least k such that prime(n) divides 4^k-1, n >= 2.
- Number of distinct letters needed to spell English names of numbers 1 through n.A082655
Number of distinct letters needed to spell English names of numbers 1 through n.
- Trajectory of 39 under map x -> x/2 if x even, 3x+9 if x odd.A082656
Trajectory of 39 under map x -> x/2 if x even, 3x+9 if x odd.
- Integers expressible as the sum of a square and a triangular number in just one way.A082657
Integers expressible as the sum of a square and a triangular number in just one way.
- Integers expressible as the sum of a square and a triangular number in exactly two distinct ways.A082658
Integers expressible as the sum of a square and a triangular number in exactly two distinct ways.
- Integers expressible as the sum of a square and a triangular number in exactly three distinct ways.A082659
Integers expressible as the sum of a square and a triangular number in exactly three distinct ways.
- Number of ways n can be expressed as the sum of a square and a triangular number.A082660
Number of ways n can be expressed as the sum of a square and a triangular number.