19692

Appears in sequences

• Sum of 12 nonzero 8th powers.at n=36A003390
• Sum of 10 positive 9th powers.at n=11A003399
• Sums of 2 distinct powers of 3.at n=38A038464
• Becomes prime after n iterations of f(x) = sigma(x)-1 (least inverse of A039655).at n=18A039656
• Sums of two powers of 3.at n=47A055235
• a(n) = floor( n^e ), e = 2.718281828...at n=37A061293
• a(n) = 3^n + n.at n=9A104743
• Indices of Glaisher-primes: values n such that the concatenation of the first n decimal digits of the Glaisher-Kinkelin constant is prime.at n=9A118420
• Triangle read by rows: (1/4) * (A007318^3 - A007318^(-1)) as infinite lower triangular matrices.at n=38A131049
• a(n) = a(n-1) + Fibonacci(n), a(1)=1983.at n=19A166876
• Number of permutations of 1..n with the Sum_{i=1..n} of (i-p(i))^2 < (n-1)*n*(n+1)/6.at n=6A180112
• Number of primes of the form (x+1)^5 - x^5 having n digits.at n=24A221847
• Numbers of the form 3^j + 9^k, for j and k >= 0.at n=36A226827
• Number of shapes of grid-filling curves of order 4*n+1 (on the square grid) with turns by +-90 degrees that are generated by Lindenmayer-systems with just one symbol apart from the turns.at n=15A265685
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 501", based on the 5-celled von Neumann neighborhood.at n=30A272566
• Expansion of phi_{9, 2}(x) where phi_{r, s}(x) = Sum_{n, m>0} m^r * n^s * x^{m*n}.at n=3A282753
• Numbers k such that Bernoulli number B_{k} has denominator 1919190.at n=12A295595
• Sum of the even parts in the partitions of n into 10 parts.at n=34A309664
• Number of pentagons in the graph formed by drawing the lines connecting any two of the 2*(n+2) perimeter points of a 3 X (n+1) rectangular grid of points (or equally, a 2 X n grid of squares).at n=42A332608
• a(n) = Sum_{d|n} tau(d)^d, where tau(n) is the number of divisors of n.at n=8A344081