Sequences
392,541 sequences
- Number of distinct prime factors of prime(n)^n-1.A069461
Number of distinct prime factors of prime(n)^n-1.
- Number of prime factors of prime(n)^n-1, with multiplicity.A069462
Number of prime factors of prime(n)^n-1, with multiplicity.
- Greatest prime factor of prime(n)^n+1.A069463
Greatest prime factor of prime(n)^n+1.
- Number of distinct prime factors of prime(n)^n+1.A069464
Number of distinct prime factors of prime(n)^n+1.
- Number of prime factors of prime(n)^n+1, with multiplicity.A069465
Number of prime factors of prime(n)^n+1, with multiplicity.
- Triangle T(n, k) of numbers of square lattice walks that start and end at origin after 2*n steps and contain exactly k steps to the east, possibly touching origin at intermediate stages.A069466
Triangle T(n, k) of numbers of square lattice walks that start and end at origin after 2*n steps and contain exactly k steps to the east, possibly touching origin at intermediate stages.
- Twin primes belonging to packs of three or more twin pairs.A069467
Twin primes belonging to packs of three or more twin pairs.
- Number of ways writing n! as a product of some other numbers which has no digits equal to 1.A069468
Number of ways writing n! as a product of some other numbers which has no digits equal to 1.
- Numbers k such that prime(reversal(k)) = reversal(prime(k)). Ignore leading 0's.A069469
Numbers k such that prime(reversal(k)) = reversal(prime(k)). Ignore leading 0's.
- a(n) = Sum_{k>=1} floor(n/(k*(k+1)/2)).A069470
a(n) = Sum_{k>=1} floor(n/(k*(k+1)/2)).
- Stirling transform of squares of Bell numbers: a(0)=1, a(n) = Sum_{k=1..n} Stirling2(n,k)*(bell(k))^2.A069471
Stirling transform of squares of Bell numbers: a(0)=1, a(n) = Sum_{k=1..n} Stirling2(n,k)*(bell(k))^2.
- Smallest twin prime in a sequence of exactly n disjoint twin pairs, sandwiched between non-twins.A069472
Smallest twin prime in a sequence of exactly n disjoint twin pairs, sandwiched between non-twins.
- First differences of (n+1)^6-n^6 (A022522).A069473
First differences of (n+1)^6-n^6 (A022522).
- First differences of A069473.A069474
First differences of A069473.
- First differences of A069474, successive differences of (n+1)^6-n^6.A069475
First differences of A069474, successive differences of (n+1)^6-n^6.
- First differences of A069475, successive differences of (n+1)^6-n^6.A069476
First differences of A069475, successive differences of (n+1)^6-n^6.
- a(n) = 60*n^2 + 180*n + 150.A069477
a(n) = 60*n^2 + 180*n + 150.
- First differences of A069477, successive differences of (n+1)^5 - n^5.A069478
First differences of A069477, successive differences of (n+1)^5 - n^5.
- Smallest n-tuply-lonely non-twin prime.A069479
Smallest n-tuply-lonely non-twin prime.
- Determinant of rank n matrix of 1..n^2 filled successively along antidiagonals.A069480
Determinant of rank n matrix of 1..n^2 filled successively along antidiagonals.
- Number of conjugacy classes of irreducible maximal finite subgroups of GL_n(Q) (the group of invertible rational n X n matrices).A069481
Number of conjugacy classes of irreducible maximal finite subgroups of GL_n(Q) (the group of invertible rational n X n matrices).
- a(n) = prime(n+1)^2 - prime(n)^2.A069482
a(n) = prime(n+1)^2 - prime(n)^2.
- Largest prime factor of prime(n+1)^2 - prime(n)^2.A069483
Largest prime factor of prime(n+1)^2 - prime(n)^2.
- a(n) = prime(n+1)^2 + prime(n)^2.A069484
a(n) = prime(n+1)^2 + prime(n)^2.
- Greatest prime factor of prime(n+1)^2 + prime(n)^2.A069485
Greatest prime factor of prime(n+1)^2 + prime(n)^2.
- a(n) = 2*prime(n)*prime(n+1).A069486
a(n) = 2*prime(n)*prime(n+1).
- Areas of Pythagorean triangles (A069482, A069484, A069486).A069487
Areas of Pythagorean triangles (A069482, A069484, A069486).
- Primes > 100 in which every substring of length 2 is also prime.A069488
Primes > 100 in which every substring of length 2 is also prime.
- Primes > 1000 in which every substring of length 3 is also prime.A069489
Primes > 1000 in which every substring of length 3 is also prime.
- Primes > 1000 in which every substring of lengths 2 and 3 are also prime.A069490
Primes > 1000 in which every substring of lengths 2 and 3 are also prime.
- a(n) = lcm(1..n) / ((n+1)(n+2)...(n+k)) where k is the largest number which gives an integral value.A069491
a(n) = lcm(1..n) / ((n+1)(n+2)...(n+k)) where k is the largest number which gives an integral value.
- 5-full numbers: if a prime p divides k then so does p^5.A069492
5-full numbers: if a prime p divides k then so does p^5.
- 6-full numbers: if p divides n then so does p^6.A069493
6-full numbers: if p divides n then so does p^6.
- Numbers n such that (reversal(n))^3 = reversal(n^3). Ignore leading 0's.A069494
Numbers n such that (reversal(n))^3 = reversal(n^3). Ignore leading 0's.
- Squares which are the arithmetic mean of two consecutive primes.A069495
Squares which are the arithmetic mean of two consecutive primes.
- Smaller member of a twin prime pair with a square sum.A069496
Smaller member of a twin prime pair with a square sum.
- Triangular numbers of the form 6*k.A069497
Triangular numbers of the form 6*k.
- Triangular numbers of the form 10*k.A069498
Triangular numbers of the form 10*k.
- Triangular numbers of the form 21*k.A069499
Triangular numbers of the form 21*k.
- a(1) = 1; a(n) = smallest multiple of a(n-1) which is a palindromic square.A069500
a(1) = 1; a(n) = smallest multiple of a(n-1) which is a palindromic square.
- a(1) = 9; a(n) = smallest multiple of a(n-1) which is a palindromic square.A069501
a(1) = 9; a(n) = smallest multiple of a(n-1) which is a palindromic square.
- a(1) = 1; a(n) = smallest multiple of a(n-1) which is a palindromic triangular number.A069502
a(1) = 1; a(n) = smallest multiple of a(n-1) which is a palindromic triangular number.
- a(1) = 2; a(n) = smallest palindromic prime of the form k*a(n-1) + 1.A069503
a(1) = 2; a(n) = smallest palindromic prime of the form k*a(n-1) + 1.
- a(1) = 2; a(n) = smallest palindromic prime of the form k*a(n-1) + 1 with k > 1.A069504
a(1) = 2; a(n) = smallest palindromic prime of the form k*a(n-1) + 1 with k > 1.
- a(1) = 1; a(n) = smallest palindromic number of the form k*a(n-1) + 1 with k > 1.A069505
a(1) = 1; a(n) = smallest palindromic number of the form k*a(n-1) + 1 with k > 1.
- a(1) = 2; a(n) = smallest palindromic number of the form k*a(n-1) + 1 with k > 1.A069506
a(1) = 2; a(n) = smallest palindromic number of the form k*a(n-1) + 1 with k > 1.
- a(1) = 4; a(n) = smallest palindromic number of the form k*a(n-1) + 1 with k > 1.A069507
a(1) = 4; a(n) = smallest palindromic number of the form k*a(n-1) + 1 with k > 1.
- a(1) = 6; a(n) = smallest palindromic number of the form k*a(n-1) + 1 with k > 1.A069508
a(1) = 6; a(n) = smallest palindromic number of the form k*a(n-1) + 1 with k > 1.
- a(1) = 8; a(n) = smallest palindromic number of the form k*a(n-1) + 1 with k > 1.A069509
a(1) = 8; a(n) = smallest palindromic number of the form k*a(n-1) + 1 with k > 1.
- a(1) = 1; a(n) = smallest palindrome of the form k*a(n-1) + 1.A069510
a(1) = 1; a(n) = smallest palindrome of the form k*a(n-1) + 1.