A283994 a(1) = 0, and for n > 1, a(n) = position of Stern polynomial B(n,x) among the irreducible/reducible Stern polynomials.

0, 1, 2, 1, 3, 2, 4, 3, 4, 5, 5, 6, 6, 7, 8, 9, 7, 10, 8, 11, 12, 13, 9, 14, 10, 15, 16, 17, 11, 18, 12, 19, 20, 21, 22, 23, 13, 24, 25, 26, 14, 27, 15, 28, 29, 30, 16, 31, 32, 33, 34, 35, 17, 36, 18, 37, 38, 39, 19, 40, 20, 41, 42, 43, 21, 44, 22, 45, 46, 47, 23, 48, 24, 49, 50, 51, 25, 52, 26, 53, 54, 55, 27, 56, 57, 58, 59, 60, 28, 61, 29, 62, 63, 64, 30

Offset: 1

Author

Antti Karttunen, Mar 20 2017

Keywords

• nonn

Comments

Each n > 0 occurs exactly twice.

Links

• Antti Karttunen, Table of n, a(n) for n = 1..10001

Crossrefs

Cf. A125184, A260443, A283991, A283992, A283993.

Cf. also A066136.

Programs

Scheme

(define (A283994 n) (if (= 1 (A283991 n)) (A283992 n) (A283993 n)))

Formula

If A283991(n) = 1 then a(n) = A283992(n), otherwise a(n) = A283993(n).