26815

Appears in sequences

• Base-9 palindromes that start with 4.at n=27A043031
• a(n) = A047980(2n).at n=32A047981
• Numbers k > 1 such that, in base 6, k and k^2 contain the same digits in the same proportion.at n=13A061660
• Positions of non-crossing fixed-point-free involutions encoded by A014486 in A055089. Permutation of A064640.at n=12A064638
• Positions of non-crossing fixed-point-free involutions encoded by A014486 (after reflection) in A055089. Permutation of A064640.at n=16A064639
• Positions of non-crossing fixed-point-free involutions (encoded by A014486) in A055089, sorted to ascending order.at n=16A064640
• Terms k of A002977 such that both (k-1)/2 and (k-1)/3 are also terms of A002977.at n=11A085249
• 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, 0), (0, 1, 1), (1, 0, 0), (1, 1, -1)}.at n=8A150253
• First appearance of n in A016014, or 0 if n never occurs.at n=32A239800
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 545", based on the 5-celled von Neumann neighborhood.at n=29A272836
• a(n) = (1/4)*(n^2 - 2*n)^2 + (9/4)*(n^2 - 2*n) + 6.at n=18A294070
• Number of vertices in a regular drawing of the complete bipartite graph K_{n,n}.at n=21A331755
• a(n) is the smallest positive integer which can be represented as the sum of distinct positive Fibonacci n-step numbers (with a single type of 1) in exactly n ways, or -1 if no such integer exists.at n=4A359631