18910

Appears in sequences

• a(n) = n*(n+1)*(2*n+1)/3.at n=30A006331
• Fibonacci sequence beginning 0, 31.at n=15A022365
• Smallest Fibonacci number that has n as a factor, divided by n.at n=43A037943
• Numbers n such that n | 5^n + 4^n + 3^n.at n=25A057236
• Numbers k such that 6^k - 5 is prime.at n=22A059614
• Numbers k such that the period of the continued fraction for sqrt(5)*k is 2.at n=35A065030
• Theorems from propositional calculus, translated into decimal digits.at n=33A101273
• a(n) = t(n)_t(n) where t() = triangular numbers A000217.at n=15A122628
• Numbers k such that k+1, k+3, k+7 and k+9 are all primes.at n=17A125855
• 1/12 of product of three numbers: n-th prime, previous and following number.at n=16A127921
• Ten times hexagonal numbers: 10*n*(2*n-1).at n=31A144560
• Half the number of length n integer sequences with sum zero and sum of squares 4050.at n=3A157577
• Number of size n nonnegative integer arrays with new values introduced in increasing order from 0, and no 2 consecutive elements totalling n or more.at n=8A193057
• Number of nXnXn 0..6 triangular arrays with each element x equal to the number its neighbors equal to 2,5,1,0,0,1,0 for x=0,1,2,3,4,5,6.at n=5A197763
• T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..2 nXk array.at n=47A219381
• Number of 3Xn arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..2 3Xn array.at n=7A219383
• Total sum of parts of multiplicity 6 in all partitions of n.at n=39A222734
• Number of (n+1) X (1+1) 0..2 arrays with no 2 X 2 subblock having the sum of its diagonal elements less than the maximum of its antidiagonal elements.at n=3A251012
• Number of (n+1)X(4+1) 0..2 arrays with no 2X2 subblock having the sum of its diagonal elements less than the maximum of its antidiagonal elements.at n=0A251015
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with no 2X2 subblock having the sum of its diagonal elements less than the maximum of its antidiagonal elements.at n=6A251019