41676

Appears in sequences

• Consider recurrence b(0) = (2n+1)/2, b(n) = b(0)*ceiling(b(n-1)); sequence gives first integer reached.at n=33A081849
• Numbers n such that (n + prime(n)), (n+1 + prime(n+1)), (n+2 + prime(n+2)) and (n+3 + prime(n+3)) are divisible by 5.at n=30A107582
• 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, 1, -1), (1, -1, 0), (1, 1, 0)}.at n=11A148522
• Words of length n over the alphabet {0,...,n-1} that avoid the pattern 1112.at n=6A239369
• Number of (undirected) paths in the graph C_3 X C_n.at n=1A339795
• Number of (undirected) paths in the graph C_4 X C_n.at n=0A339796
• a(n) = Sum_{k=0..n} (-9)^k * binomial(-1/3,k) * binomial(n*k,n-k).at n=5A361846