19455

Appears in sequences

• Waring's problem: least positive integer requiring maximum number of terms when expressed as a sum of positive n-th powers.at n=8A018886
• Numbers n such that p(n),p(n)+6,p(n)+12,p(n)+18 are consecutive primes and p(n)=6*k+1 for some k, where p(n) denotes n-th prime.at n=30A090838
• a(n) = 1024*n - 1.at n=18A158421
• a(n) = 76*n^2 - 1.at n=15A158765
• Integers n such that exactly 80 percent of the digits in base 2 are 1's.at n=41A163142
• a(n) = 19*2^n-1.at n=10A198276
• Odd numbers n such that the sum of the binary digits of n and n^2 both equal 12.at n=15A261593
• Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 533", based on the 5-celled von Neumann neighborhood.at n=14A288980
• Partial sums of A299256.at n=23A299262
• G.f. A(x) satisfies: Sum_{n>=0} ( 1/A(x) - 1/(1+x)^(5*n) )^n = 1.at n=4A317995
• a(1) = 1; if the sum of the digits of 2*a(n-1) + 1 is not yet in the sequence then a(n) = 2*a(n-1) + 1; otherwise a(n) is the sum of digits of a(n-1).at n=45A348483
• a(n) is the largest number t such that there exist numbers i,j,k such that, for all m <= t, there exist integers x,y,z with x*i + y*j + z*k = m and |x|+|y|+|z| <= n.at n=36A383579