392250
domain: N
Appears in sequences
- Number of distinct solutions of sum{i=1..10}(x(2i-1)*x(2i)) = 1 (mod n), with x() in 0..n-1.at n=4A180812
- Triangle read by rows. Each term of the triangle is positive and distinct. In row k are the next k least numbers such that the sum of any one number from each of the first k rows is a prime number.at n=9A359668