25186

Appears in sequences

• a(n+1) = a(n)/2 if 2|a(n), a(n)/3 if 3|a(n), a(n)/5 if 5|a(n), a(n)/7 if 7|a(n), a(n)/11 if 11|a(n), a(n)/13 if 13|a(n), otherwise 17*a(n)+1.at n=24A057534
• Expansion of (1 - 3x)/(1 - x + 2x^2 - x^3).at n=36A119303
• Numbers n such that d(n-2) = d(n) = d(n+2) = 12 where d(n)=A000005(n).at n=23A190645
• Number of n X 2 arrays of the minimum value of corresponding elements and their horizontal or vertical neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..2 n X 2 array.at n=23A219589
• Number of ordered unlabeled rooted trees with n nodes such that the minimal outdegree of inner nodes equals 4.at n=17A244533
• Numbers k such that 9*10^k - 19 is prime.at n=22A293278
• First term of n-th difference sequence of (floor(k*r)), r = sqrt(1/3), k >= 0.at n=16A325730
• First term of n-th difference sequence of (floor(e*k/(e-1))), k >= 0.at n=16A325749
• Triangle read by rows: T(n,k) is the number of self-avoiding paths of length 2*(n-1+k) connecting opposite corners in the n X n grid graph (0 <= k <= floor((n-1)^2/2), n >= 1).at n=34A333520
• a(1) = 1; a(n) = 1 + a(n-1) + Sum_{k=2..n} a(floor(n/k)).at n=42A351621