36400

Appears in sequences

• a(1) = 5; for n > 0, a(n+1) = a(n) * sum of digits of a(n).at n=4A047897
• Partial sums of A034263.at n=11A051947
• Numbers which can be expressed as the product of a number and its reversal in at least two different ways.at n=25A066531
• Numbers k such that sigma(k^2 + 1) == 0 (mod k).at n=39A067719
• Numbers n such that sopf(sigma(n)) = sigma(sopf(n)), where sopf(x) = sum of the distinct prime factors of x.at n=39A076532
• a(n) = direuler(p=2,n,1/(1-X)/(1-p*n*X))[n].at n=32A089745
• 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, 0, 0), (0, -1, 1), (0, 1, -1), (1, 0, 1)}.at n=10A148783
• The n-th term in the sequence is the minimal number that has some subset of DPS's that form an n-term arithmetic progression.at n=4A165212
• a(2*n) = (n+1)*a(n), a(2*n+1) = (n+1)*a(n+1), with a(1) = 1.at n=47A171609
• Number of 4-step knight's tours on an (n+2) X (n+2) board summed over all starting positions.at n=10A186853
• Number of pairs of intersecting diagonals in the interior and exterior of a regular n-gon.at n=23A211380
• Smallest k > 1 such that k^n has k as its middle digits, or 0 if no such k exists.at n=49A225795
• Recurrence a(n) = a(n-2) + n^M for M=4, starting with a(0)=0, a(1)=1.at n=12A231303
• Number of ON cells in 3-D cellular automaton described in Comments, after n generations.at n=23A246031
• Number of ON cells in 3-D cellular automaton described in Comments, after n generations.at n=29A246031
• Number of ON cells in 3-D cellular automaton described in Comments, after n generations.at n=39A246031
• Number of ON cells in 3-D cellular automaton described in Comments, after n generations.at n=46A246031
• Number of ON cells in 3-D cellular automaton described in Comments, after n generations.at n=57A246031
• Number of ON cells in 3-D cellular automaton described in Comments, after n generations.at n=58A246031
• Expansion of 1 / ((1 - x)^7*(1 + x)^4).at n=22A299336