32085

Appears in sequences

• Cupolar numbers: a(n) = (n+1)*(5*n^2 + 7*n + 3)/3.at n=26A096000
• a(n) = a(n-1) + 2*a(n-2) + a(n-3) - a(n-4).at n=14A101400
• Nonnegative values x of solutions (x, y) to the Diophantine equation x^2+(x+223)^2 = y^2.at n=10A130609
• a(n) = (2*n^3 + 5*n^2 - 7*n)/2.at n=30A162261
• Number of (w,x,y,z) with all terms in {1,...,n} and w<average{x,y,z}.at n=16A212088
• Numbers k such that 2^k - 1 - Sum_{prime p<k} 2^p is prime.at n=33A215888
• Maximum size of a class of binary words of length n having the same prefix normal form.at n=28A238110
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 579", based on the 5-celled von Neumann neighborhood.at n=32A273028
• Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 147", based on the 5-celled von Neumann neighborhood.at n=15A279175
• Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 155", based on the 5-celled von Neumann neighborhood.at n=15A279252
• Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 219", based on the 5-celled von Neumann neighborhood.at n=15A279957
• Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 841", based on the 5-celled von Neumann neighborhood.at n=15A284245
• Numbers k such that k, k^2-1 and k^2+1 are all fine, where a number m is fine if its prime factors are all less than m^(1/3).at n=6A345896
• a(n) = ord(2,A006935(n)/2), where ord(k,m) is the multiplicative order of k modulo m.at n=7A350084
• a(n) is the smallest positive integer which can be represented as the sum of n distinct nonzero square pyramidal numbers in exactly n ways, or -1 if no such integer exists.at n=20A360218
• a(n) is the denominator of the rational number with the smallest denominator that lies within 1/10^n of Pi.at n=8A360367
• Numbers k such that k^2 is an odd primitive abundant number (A006038).at n=1A379950
• Numbers k such that k^2 is abundant but d*k is nonabundant for any proper divisor d of k.at n=5A381742
• Numbers k such that omega(k) = 4 and the largest prime factor of k equals the sum of its remaining distinct prime factors, where omega(k) = A001221(k).at n=17A383728
• Maximum word length generated by acyclic context-free grammar in Greibach normal form whose grammar size is at most n.at n=36A389642