117306

Appears in sequences

• Number of elements of GF(7^n) with trace 0 and subtrace 1.at n=7A074015
• Number of elements of GF(7^n) with trace 1 and subtrace 1.at n=7A074018
• Number of elements of GF(7^n) with trace 1 and subtrace 2.at n=7A074019
• Number of elements of GF(7^n) with trace 1 and subtrace 4.at n=7A074021
• Largest x such that 1/x + 1/y + 1/z = 1/n.at n=17A082986
• a(1) = 1. a(n) = a(n-1) + a(m), where m is the largest term of the sequence {a(k)} which is less than n.at n=41A133488
• a(n) = n^6 - n^3.at n=7A136006
• a(n) = prime(n)^6 - prime(n)^3.at n=3A138410
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, -1, 1), (-1, 1, 0), (1, 0, 1), (1, 1, -1)}.at n=10A148907
• Minimal covering numbers.at n=49A160559
• a(n) = n*(n+1)*(n*(n+1)+1).at n=19A169938
• a(n) = n^4 + 6n^3 + 14n^2 + 15n + 6.at n=17A176780
• a(1) = 1; for n>1, a(n) = smallest integer > a(n-1) such that a(n)*a(n-i)+1 is prime for all 0 <= i <= n-1.at n=5A219761
• Number of (n+1) X (6+1) 0..1 arrays with every 2 X 2 subblock ne-sw antidiagonal difference nondecreasing horizontally and nw+se diagonal sum nondecreasing vertically.at n=13A258552
• Depth of Pascal's triangle such that the number of elements in the triangle is a factor of the sum of the elements.at n=30A272934