38736

Appears in sequences

• Numbers n such that n and 2^n end with the same 4 digits.at n=3A067867
• Number of permutations of {1,...,n} avoiding adjacent step pattern up, down, down, up, down, down.at n=8A177538
• Expansion of Product_{k>=0} 1/(1-x^(3*k+1))^4.at n=21A261635
• Number of nX5 arrays of permutations of 5 copies of 0..n-1 with every element equal to or 1 greater than any west or northeast neighbors modulo n and the upper left element equal to 0.at n=7A267739
• a(n) = permanent M_n where M_n is the n X n matrix m(i,j) = i^3 + j^3.at n=3A278925
• Number of nX6 0..1 arrays with every element equal to 1, 2 or 3 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=3A302222
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2 or 3 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=39A302224
• Number of 4Xn 0..1 arrays with every element equal to 1, 2 or 3 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=5A302227
• Number of nX6 0..1 arrays with every element equal to 1, 2, 3 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=3A302668
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=39A302670
• a(n) = Sum_{k=0..n} sigma(k^2 + 1), where sigma(k) is the sum of divisors of k (A000203).at n=43A333172
• Numbers k that have at least two different representations as the product of a number and of its decimal digits.at n=22A336944
• Keys added to a map T initialized with T[1] = 1 and updated at each iteration according to T[value] := (T[value] if defined else 0) + key, for all (key, value) pairs already in T; listed in order the keys are added to the map (cf. comments for details).at n=48A390939
• Value of T[4] after the n-th iteration, when the map T is initialized with T[1] = 1 and in subsequent iterations, T[v] = k + (T[v] if defined else 0) for all key-value pairs (k, v) in T; a(n) = 0 if T[4] isn't defined yet.at n=19A390944