35131

Appears in sequences

• a(n) = sum of squares of first n positive integers congruent to 1 mod 4.at n=18A024381
• Number of partitions satisfying cn(0,5) <= cn(1,5) and cn(0,5) <= cn(4,5).at n=42A039837
• Consider the Diophantine equation x^3 + y^3 = z^3 + 1 (1 < x < y < z) or 'Fermat near misses'. Arrange solutions by increasing values of z (see A050791). Sequence gives values of x.at n=32A050792
• Numerators of row 4 of table described in A051714/A051715.at n=42A051722
• Trajectory of 18 under iteration of the map k -> A087712(k).at n=19A077960
• Numbers n with property that n^2 contains "1234" as a substring.at n=17A175464
• Expansion of g.f. -(1+x)*(1+sqrt(1-4*x))/(2*(1-x-x^2)).at n=11A201164
• a(n) = number of n-lettered words in the alphabet {1, 2, 3} with as many occurrences of the substring (consecutive subword) [1, 1, 2] as of [2, 2, 1].at n=10A211294
• In Zeckendorf representation: integers that set a new record for the number of Reverse and Add steps (A349239) needed to reach a palindrome (A094202).at n=11A348571