Sequences
392,541 sequences
- Numerators of convergents to 3/(1 + sqrt(10)).A093611
Numerators of convergents to 3/(1 + sqrt(10)).
- Primes of form 7^n-2.A093612
Primes of form 7^n-2.
- Table read by rows: row n is the n-th Primary Phyllotaxis Sequence (PPS), which has F(n+1) terms, where F(n) is the n-th Fibonacci number. For 1 <= k < F(n+1), a(n, k) = -k*F(n-1) mod F(n+1). a(n, F(n+1)) = F(n+1).A093613
Table read by rows: row n is the n-th Primary Phyllotaxis Sequence (PPS), which has F(n+1) terms, where F(n) is the n-th Fibonacci number. For 1 <= k < F(n+1), a(n, k) = -k*F(n-1) mod F(n+1). a(n, F(n+1)) = F(n+1).
- Numbers n such that F_n(x) and F_n(1-x) have a common factor mod 2, with F_n(x) = U(n-1,x/2) the monic Chebyshev polynomials of second kind.A093614
Numbers n such that F_n(x) and F_n(1-x) have a common factor mod 2, with F_n(x) = U(n-1,x/2) the monic Chebyshev polynomials of second kind.
- E.g.f. equals the ratio of two power series, each with triangular exponents of x.A093615
E.g.f. equals the ratio of two power series, each with triangular exponents of x.
- a(n) is the smallest k such that k*n has exactly as many divisors as n^2.A093616
a(n) is the smallest k such that k*n has exactly as many divisors as n^2.
- Numbers m such that there exists a number k less than m with k*m and m^2 having an equal number of divisors.A093617
Numbers m such that there exists a number k less than m with k*m and m^2 having an equal number of divisors.
- Numbers m such that for all k less than m the number of divisors of k*m and m^2 are different.A093618
Numbers m such that for all k less than m the number of divisors of k*m and m^2 are different.
- Decimal expansion of e^(-2*e).A093619
Decimal expansion of e^(-2*e).
- Values of Laguerre polynomials: a(n) = 2^n*n!*LaguerreL(n,-1/2,-2).A093620
Values of Laguerre polynomials: a(n) = 2^n*n!*LaguerreL(n,-1/2,-2).
- Smallest k>0 such that n!/k!+1 is prime.A093621
Smallest k>0 such that n!/k!+1 is prime.
- Largest prime of the form n!/k!-1.A093622
Largest prime of the form n!/k!-1.
- Smallest k>0 such that n!/k!-1 is prime.A093623
Smallest k>0 such that n!/k!-1 is prime.
- Decimal expansion of e^(-3*e).A093624
Decimal expansion of e^(-3*e).
- Primes of the form (3^m + 1)/2.A093625
Primes of the form (3^m + 1)/2.
- Decimal expansion of e^(-4*e).A093626
Decimal expansion of e^(-4*e).
- a(n) = lcm(1,2,3,...,n) * (sum of Farey fractions of order n).A093627
a(n) = lcm(1,2,3,...,n) * (sum of Farey fractions of order n).
- Triangle, read by rows, such that diagonal n is equal to the Euler transform of row n, where each row starts with 1.A093628
Triangle, read by rows, such that diagonal n is equal to the Euler transform of row n, where each row starts with 1.
- Row sums of triangle A093628, in which the diagonals are equal to the Euler transform of the rows.A093629
Row sums of triangle A093628, in which the diagonals are equal to the Euler transform of the rows.
- Central terms of triangle A093628, in which the diagonals are equal to the Euler transform of the rows.A093630
Central terms of triangle A093628, in which the diagonals are equal to the Euler transform of the rows.
- Primes of the form 6*10^k + R_k, where R_k is the repunit (A002275) of length k.A093631
Primes of the form 6*10^k + R_k, where R_k is the repunit (A002275) of length k.
- Primes of the form 7*10^k + R_k, where R_k is the repunit (A002275) of length k.A093632
Primes of the form 7*10^k + R_k, where R_k is the repunit (A002275) of length k.
- Primes of the form 8*10^k + R_k, where R_k is the repunit (A002275) of length k.A093633
Primes of the form 8*10^k + R_k, where R_k is the repunit (A002275) of length k.
- Primes of the form 9*10^k + R_k, where R_k is the repunit (A002275) of length k.A093634
Primes of the form 9*10^k + R_k, where R_k is the repunit (A002275) of length k.
- G.f.: A(x) = Product_{n>=0} (1+a(n)*x^(n+1))^2 = Sum_{n>=0} a(n)*x^n.A093635
G.f.: A(x) = Product_{n>=0} (1+a(n)*x^(n+1))^2 = Sum_{n>=0} a(n)*x^n.
- Self-convolution forms A093635.A093636
Self-convolution forms A093635.
- G.f.: A(x) = Product_{n>=0} 1/(1 - a(n)*x^(n+1)) = Sum_{n>=0} a(n)*x^n.A093637
G.f.: A(x) = Product_{n>=0} 1/(1 - a(n)*x^(n+1)) = Sum_{n>=0} a(n)*x^n.
- G.f. satisfies: A(x) = Product_{n>=0} 1/(1-a(n)*x^(n+1))^2 = Sum_{n>=0} a(n)*x^n.A093638
G.f. satisfies: A(x) = Product_{n>=0} 1/(1-a(n)*x^(n+1))^2 = Sum_{n>=0} a(n)*x^n.
- Self-convolution forms A093638.A093639
Self-convolution forms A093638.
- Number of divisors of n whose binary representation is contained in that of n.A093640
Number of divisors of n whose binary representation is contained in that of n.
- Numbers of form 2^i * prime(j), i>=0, j>0, together with 1.A093641
Numbers of form 2^i * prime(j), i>=0, j>0, together with 1.
- Numbers not containing all divisors in their binary representation.A093642
Numbers not containing all divisors in their binary representation.
- Integer quotients arising in A015759.A093643
Integer quotients arising in A015759.
- (9,1) Pascal triangle.A093644
(9,1) Pascal triangle.
- (10,1) Pascal triangle.A093645
(10,1) Pascal triangle.
- Higher dimensional figurate numbers based on 12-gonal numbers A051624.A093646
Higher dimensional figurate numbers based on 12-gonal numbers A051624.
- Records in A093101.A093647
Records in A093101.
- Advancing position of digits of Pi in e.A093648
Advancing position of digits of Pi in e.
- Numbers n such that n.s.rev(n) is palindromic and prime, where '.' represents concatenation, rev(n) is the reversal of n and s is the sum of n and rev(n). Or, n such that A084998(n) is prime.A093649
Numbers n such that n.s.rev(n) is palindromic and prime, where '.' represents concatenation, rev(n) is the reversal of n and s is the sum of n and rev(n). Or, n such that A084998(n) is prime.
- Natural numbers arranged in a square maze beginning 1, 2, 3, then moving right, then up, right, down, left, down, right, etc., and read by antidiagonals upwards.A093650
Natural numbers arranged in a square maze beginning 1, 2, 3, then moving right, then up, right, down, left, down, right, etc., and read by antidiagonals upwards.
- Where records occur in A093101.A093651
Where records occur in A093101.
- Let a(1) = 1, a(2) = 2, a(3) = 7, a(4) = 15 and for n >= 5 set a(n) = (n*b(n) - b(n-2)) / 2, where b(n) = 4*b(n-2) - b(n-4) for n >= 5 and b(1) = 1, b(2) = 2, b(3) = 5, b(4) = 8.A093652
Let a(1) = 1, a(2) = 2, a(3) = 7, a(4) = 15 and for n >= 5 set a(n) = (n*b(n) - b(n-2)) / 2, where b(n) = 4*b(n-2) - b(n-4) for n >= 5 and b(1) = 1, b(2) = 2, b(3) = 5, b(4) = 8.
- Total number of 1's in binary expansion of all divisors of n.A093653
Total number of 1's in binary expansion of all divisors of n.
- Lower triangular matrix, read by rows, defined as the convergent of the concatenation of matrices using the iteration: M(n+1) = [[M(n),0*M(n)],[M(n)^2,M(n)^2]], with M(0) = [1].A093654
Lower triangular matrix, read by rows, defined as the convergent of the concatenation of matrices using the iteration: M(n+1) = [[M(n),0*M(n)],[M(n)^2,M(n)^2]], with M(0) = [1].
- First column of lower triangular matrix A093654.A093655
First column of lower triangular matrix A093654.
- Row sums of lower triangular matrix A093654.A093656
Row sums of lower triangular matrix A093654.
- 2^(n-1)-th term of the row sums of triangle A093654.A093657
2^(n-1)-th term of the row sums of triangle A093654.
- Lower triangular matrix, read by rows, defined as the convergent of the concatenation of matrices using the iteration: M(n+1) = [[M(n),0*M(n)],[M(n)^2,M(n)]], with M(0) = [1].A093658
Lower triangular matrix, read by rows, defined as the convergent of the concatenation of matrices using the iteration: M(n+1) = [[M(n),0*M(n)],[M(n)^2,M(n)]], with M(0) = [1].
- First column of lower triangular matrix A093658; factorial of the number of 1's in binary expansion of n.A093659
First column of lower triangular matrix A093658; factorial of the number of 1's in binary expansion of n.
- Row sums of lower triangular matrix A093658.A093660
Row sums of lower triangular matrix A093658.