19322

Appears in sequences

• Number of partitions of n^2 into distinct squares.at n=43A030273
• a(n) = prime(n)^2 + 1.at n=33A066872
• Triangle read by rows: T(n,k) is the number of Dyck n-paths with k large components, 0 <= k <= n/2.at n=38A097877
• Numbers k such that both the k-th and (k+1)-th primes have the same sum of digits squared but different sets of digits.at n=5A109183
• 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, 0, 0), (0, -1, 0), (0, 0, 1), (0, 1, 0), (1, 1, -1)}.at n=8A150140
• a(n) = 81*n^2 - 90*n + 26.at n=16A154295
• Number of disconnected 2-regular graphs on n vertices.at n=56A165652
• Numbers n such that n!10-1 is prime.at n=32A204658
• Smallest number with n as least nonnegative primitive root, or 0 if no such number exists.at n=39A214158
• Smallest even k such that lpf(k-1) = prime(n), while lpf(k-3) > prime(n), where lpf=least prime factor (A020639).at n=32A242489
• Smallest even k such that lpf(k-3) > lpf(k-1) >= prime(n), where lpf=least prime factor (A020639).at n=31A242719
• Smallest even k such that lpf(k-3) > lpf(k-1) >= prime(n), where lpf=least prime factor (A020639).at n=32A242719
• The smallest numbers of every class in a classification of positive numbers (see comment).at n=35A247395
• Triangle, read by rows, T(n,k) = (k+1)*Sum_{i=0..n-k} C(k+2*i,i)*C(n-i-1,n-k-i)/(k+i+1).at n=58A247582
• Numbers that are both 1 + square of a prime and twice a prime.at n=11A259979
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 158", based on the 5-celled von Neumann neighborhood.at n=37A270335
• Values of n such that A080221(n)=6; i.e., values of n such that n is divisible by the sum of digits of n when expressed in exactly 6 of the bases b=1...n.at n=22A271311
• a(n) is the least positive k such that A000041(n) divides A000041(n+k), or 0 if no such k exists.at n=55A346696