90385

Appears in sequences

• Fibonacci sequence beginning 1, 21.at n=19A022391
• a(n) = n*F(n-1) + F(n), where F = A000045.at n=20A094588
• Start with {1, x}, then at each step replace it with the set of all pairwise products and sums of its elements (an element can be paired with itself). a(n) gives the number of elements after n-th step.at n=4A382928