A331809 a(1) = 1; a(2) = 2; thereafter a(n) is the smallest number > a(n-1) which is neither of the form 2*a(i) nor Sum_{j=1..n-1} ( b_j*a(j) ) where 0 < i < n, b_j = 1 or 0.

1, 2, 5, 9, 13, 31, 35, 92, 118, 280, 350, 866, 1102, 2668, 3368, 8240, 10444, 25420, 32156, 78464, 99352, 242128, 306440, 747272, 945976, 2306128, 2919008, 7117088, 9009040, 21964144, 27802160, 67784384, 85802464, 209191168, 264795488, 645591584, 817196512, 1992379072

Offset: 1

Author

Zhandos Mambetaliyev, Jan 27 2020

Keywords

• nonn

Comments

Inserting the additional term a(0) = 3 would result in a so-called complete sequence after sorting. (The sorted sequence will then meet Brown's criterion.)

Links

• Eric Weisstein's World of Mathematics, Brown's Criterion
• Eric Weisstein's World of Mathematics, Complete Sequence

Crossrefs

Cf. A126326, A331800, A331811.

Programs

PARI

/* a(n) for 0
				

Extensions

a(12)-a(15) from Hugo Pfoertner, Jan 27 2020

More terms, using Rémy Sigrist's C++ at A331811 from Hugo Pfoertner, Jan 28 2020