24013
domain: N
Appears in sequences
- Deceptive nonprimes: composite numbers k that divide the repunit R_{k-1}.at n=31A000864
- Pseudoprimes to base 21.at n=40A020149
- Strong pseudoprimes to base 12.at n=16A020238
- Strong pseudoprimes to base 65.at n=16A020291
- Strong pseudoprimes to base 100.at n=32A020326
- a(n) is the (n+1)st (n+2)-gonal number.at n=36A064808
- Numbers k such that [A070080(k), A070081(k), A070082(k)] is an integer Heronian triangle having triangular area.at n=21A070148
- Number triangle read by rows: T(n,k) = Sum_{j=0..n-k} C(n+j,j+k)*C(n-j,k).at n=38A117207
- Main diagonal of polygonal lucky array defined in A128511.at n=13A128947
- Left edge of the triangle A045975.at n=36A204556
- In base 5, numbers n which have 5 distinct digits, do not start with 0, and have property that the product (written in base 5) of any two adjacent digits is a substring of n.at n=6A210016
- T(n,k)=Number of length (n+k)X1 arrays of occupancy after each element moves up to +-k places but not 0 and without 2-loops.at n=28A222165
- Number of (n+2)X(1+2) 0..1 arrays with each row and column not divisible by 5, read as a binary number with top and left being the most significant bits.at n=3A263033
- Number of (n+2)X(4+2) 0..1 arrays with each row and column not divisible by 5, read as a binary number with top and left being the most significant bits.at n=0A263036
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each row and column not divisible by 5, read as a binary number with top and left being the most significant bits.at n=6A263040
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each row and column not divisible by 5, read as a binary number with top and left being the most significant bits.at n=9A263040
- 38-gonal numbers: a(n) = n*(18*n-17).at n=37A282850
- Number of positive integers with n digits that are the product of two integers ending with 8.at n=5A348549
- Products of three distinct strong primes.at n=19A363782