48310

Appears in sequences

• Start with a(1)=1; for n >= 1, a(n+1)=a(n)+a(k) with k=[n - n-th digit of sqrt(2)]. If k<0 or k=0, then a(k)=0.at n=39A133393
• 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, 0), (-1, 0, 0), (-1, 1, 0), (1, 0, 1), (1, 1, -1)}.at n=9A149398
• Number of (7+2) X (n+2) 0..3 arrays with every 3 X 3 subblock row and diagonal sum equal to 0 3 5 6 or 7 and every 3 X 3 column and antidiagonal sum not equal to 0 3 5 6 or 7.at n=14A252391
• Numbers k whose decimal representation can be split in three parts which can be used as seeds for a tribonacci-like sequence containing k itself.at n=33A383230