26509

Appears in sequences

• 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, 0, 0), (-1, 0, 1), (0, -1, 1), (1, 1, 0)}.at n=9A149245
• Number of partitions of n such that the m(number of distinct parts) is a part, where m = multiplicity.at n=45A240307
• Greatest integer k such that k/2^n < (1+sqrt(5))/2 (the golden ratio).at n=14A293313
• Triangle T(n,k) read by rows: number of series-reduced labeled graphs on n nodes with k components.at n=22A307806
• a(n) = k if k is odd otherwise a(n) = k+1 and k = floor( 2^n*(1+sqrt(5))/2 ).at n=14A376448