271468
domain: N
Appears in sequences
- Let S(1) = {1} and, for n>1 let S(n) be the smallest set containing x, 2x and x+2 for each element x in S(n-1). a(n) is the number of elements in S(n).at n=25A122554
- a(n) = n + 2*cos((n*Pi)/3) + Lucas(n).at n=25A297661
- Number of chordless cycles in the n-web graph.at n=23A297665
- Expansion of e.g.f. exp(x) / (4 - 3*exp(3*x)).at n=4A368441