75036

Appears in sequences

• a(1) = 1; for n >= 1, a(n+1) is smallest number such that the sums of any one, two or three of a(1), ..., a(n) are distinct (repetitions not allowed).at n=32A062065
• Let f(0)=1, f(1)=t, f(n+1) = (f(n)^2+t^n)/f(n-1). f(t) is a polynomial with integer coefficients. Then a(n) = f(n) when t=3.at n=8A081704
• a(n) = Fibonacci(n + 2) + floor(n/2).at n=23A167270
• Number of 4Xn 0..1 arrays with every element equal to 0 or 1 horizontally or antidiagonally adjacent elements, with upper left element zero.at n=20A301793
• Number of cyclic subgroups of the group GL(2, Z(n)), counting conjugates as distinct.at n=30A316560
• Number of permutations w in S_n that form Boolean intervals [s, w] in the Bruhat order for every simple reflection s in the support of w.at n=12A331347