41553

Appears in sequences

• Numbers n such that n divides 2^n + 1.at n=20A006521
• Numbers k that divide s(k), where s(1)=1, s(j)=19*s(j-1)+j.at n=30A014869
• Numbers k such that k | 8^k + 1.at n=25A015955
• Pseudo-powers to base 3: numbers k that are not powers of 3 such that k divides 2^k + 1.at n=10A016057
• a(n) = A024733(n+3)/7.at n=13A024734
• Base 8 digits are, in order, the first n terms of the periodic sequence with initial period 1,2,1.at n=5A037541
• Odd numbers divisible by exactly 8 primes (counted with multiplicity).at n=11A046321
• Ordered factorizations with one level of parentheses indexed by prime signatures. A050354(A025487).at n=34A050355
• Iterated procedure 'composite k added to sum of its prime factors reaches a prime' yields 1 skipped prime.at n=23A050768
• Numbers n such that n | 12^n + 11^n + 10^n + 9^n + 8^n + 7^n.at n=38A057257
• a(n) = 3^n mod n^3.at n=35A066607
• 3rd binomial transform of (1,2,0,0,0,0,0,0,...).at n=8A081038
• Numbers n such that n divides 2^n^2 + 1.at n=28A093546
• Numbers k that divide 2^(k^3) + 1.at n=29A093665
• Expansion of 1/(3*x^2 - 3*x + 1)^2.at n=14A115052
• a(n) = 3^n*pentanacci(n) or (3^n)*A023424(n-1).at n=5A127222
• 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, 0), (0, 1, -1), (0, 1, 0), (1, -1, 1)}.at n=10A148421
• Square array T(n, k) = v(k, n)((1)), where v(n, q) = M*v(n-1, q), M = {{0, 1, 0}, {0, 0, 1}, {q^3, q^3, 0}}, with v(0, q) = {1, 1, 1}, read by antidiagonals.at n=47A173749
• a(n) = 19*3^n.at n=7A176413
• Triangular array: the fusion of (x+1)^n and (x+2)^n; see Comments for the definition of fusion.at n=53A193722