35943

Appears in sequences

• a(n) = n OR n^3 (applied to ternary expansions).at n=32A008469
• a(n) = n^3 + 6.at n=33A084382
• Number of 0..13 integer arrays v[1..n] of length n with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..n-1.at n=3A171319
• Number of 0..n-1 integer arrays v[1..4] of length 4 with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..3.at n=13A171355
• Partial sums of A001605.at n=25A172115
• Total number of nodes summed over all self-avoiding planar walks starting at (0,0), ending at (n,0), remaining in the first quadrant and using steps (0,1), (1,0), (1,1), (-1,1), and (1,-1) with the restrictions that (0,1) and (1,-1) are never used above the diagonal and (1,0) and (-1,1) are never used below the diagonal and (1,1) can only be used below the diagonal.at n=8A303478