43238

Appears in sequences

• Numbers n such that n | 10^n + 9^n + 1.at n=41A057295
• a(n) = floor(2^n*log(n)).at n=13A094939
• 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, -1, -1), (-1, 0, 1), (1, 0, 1), (1, 1, -1), (1, 1, 0)}.at n=8A150588
• a(n) = 64*n^2 - n.at n=25A157948
• a(n) = 256*n^2 - 2*n.at n=12A158249
• a(n) = 676*n^2 - 26.at n=7A158639
• Triangle read by rows: T(n, k) = Sum_{j=0..n} binomial(-j-1, -n-1)*S1(j, k) where S1 are the Stirling cycle numbers A132393.at n=48A269953
• Total number of colors used in all colored integer partitions of n where all colors from an initial interval of the color palette are used and parts differ by size or by color.at n=12A325915
• Expansion of e.g.f. -log(1-x)^3 * exp(-x) / 6.at n=9A381065