1420541793
domain: N
Appears in sequences
- Number of ways to add n ordinals.at n=24A005348
- a(n) = 11*3^n.at n=17A120354
- a(n) = (2n + 1)*3^n.at n=16A124647
- a(n) = 3^(n-1) * (n+1)^(n-3) * (n+3).at n=8A251583
- Let S = smallest missing positive number, adjoin S, 3*S, 9*S, 27*S, 81*S, ... to the sequence until reaching a term that has S as a substring; reset S to the smallest missing positive number, repeat.at n=49A331631