A004957 a(n) = ceiling(n*phi^2), where phi is the golden ratio, A001622.

0, 3, 6, 8, 11, 14, 16, 19, 21, 24, 27, 29, 32, 35, 37, 40, 42, 45, 48, 50, 53, 55, 58, 61, 63, 66, 69, 71, 74, 76, 79, 82, 84, 87, 90, 92, 95, 97, 100, 103, 105, 108, 110, 113, 116, 118, 121, 124, 126, 129, 131, 134

Offset: 0

Author

N. J. A. Sloane

Keywords

• nonn

Links

• Reinhard Zumkeller, Table of n, a(n) for n = 0..10000

Crossrefs

Essentially same as A026352.

Cf. A001622.

Programs

Haskell

import Data.List (findIndices)
a004957 n = a004957_list !! n
a004957_list = findIndices even a060142_list
-- Reinhard Zumkeller, Nov 26 2012

Formula

A060142(a(n)) = 4 * A060142(n). - Reinhard Zumkeller, Nov 26 2012