19918

Appears in sequences

• Fibonacci sequence beginning 4, 10.at n=17A022382
• s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A023532, t = (Fibonacci numbers).at n=20A024367
• 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, 1, -1), (0, 1, 1), (1, -1, 1), (1, 0, 0)}.at n=8A150024
• 3-comma numbers: n occurs in the sequence S[k+1]=S[k]+10*last_digit(S[k-1])+first_digit(S[k]) for three different splittings n=concat(S[0],S[1]).at n=20A166513
• Numbers k such that sigma(k+2) = 2*sigma(k).at n=4A175876
• a(n) is the number of balanced-non-self-conjugate partitions of n.at n=54A331262
• Numbers k such that there is more than one possible solution for A367338(k).at n=20A367346