32146

Appears in sequences

• a(n) = T(n,n), T given by A026519. Also a(n) = number of integer strings s(0), ..., s(n), counted by T, such that s(n) = 0.at n=14A026520
• a(n) = T(n,n), T given by A026536. Also a(n) = number of integer strings s(0), ..., s(n), counted by T, such that s(n)=0.at n=14A026537
• Numbers n such that sigma(sigma(phi(n))) = sigma(sigma(n)).at n=35A172466
• a(0) = 1; for n > 0, a(n) = 41*n^2 + 2.at n=28A206399
• Number of arrays of median of three adjacent elements of some length n+2 0..3 array, with no adjacent equal elements in the latter.at n=9A229007
• a(1)=1, a(n+1) is the smallest number m such that A244448(a(n)) < A244448(m).at n=8A246628
• Irregular triangle read by rows: T(n,m) = number of lattice paths of type {B^H}_R terminating at point (n, m).at n=49A291084
• a(n) = A026520(2n).at n=7A291088
• First differences of A293230: how many more alive nodes there are in generation n+1 than in generation n in the binary tree of persistently squarefree numbers.at n=37A293440
• Records in A181159.at n=33A306332
• Total binary weight squared of all A005251(n) binary sequences of length n not containing any isolated 1's.at n=12A332863