473513931

Appears in sequences

• a(n) = 11*3^n.at n=16A120354
• Number of ascending runs in {1,...,3}^n.at n=16A229277
• a(n) is the smallest number having exactly n ways to be represented as sum of at least two consecutive positive integers and expressible as sum of n consecutive positive integers, or 0 if no such number exists.at n=31A316744
• 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=48A331631
• a(n) is the smallest positive integer k such that A002325(k) = n.at n=33A374294