The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A004957 a(n) = ceiling(n*phi^2), where phi is the golden ratio, A001622. 7
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS A060142(a(n)) = 4 * A060142(n). - Reinhard Zumkeller, Nov 26 2012 REFERENCES Mohammad K. Azarian, Problem 123, Missouri Journal of Mathematical Sciences, Vol. 10, No. 3, Fall 1998, p. 176.  Solution published in Vol. 12, No. 1, Winter 2000, pp. 61-62. LINKS Reinhard Zumkeller, Table of n, a(n) for n = 0..10000 PROG (Haskell) import Data.List (findIndices) a004957 n = a004957_list !! n a004957_list = findIndices even a060142_list -- Reinhard Zumkeller, Nov 26 2012 CROSSREFS Essentially same as A026352. Sequence in context: A310136 A310137 A157017 * A026352 A198084 A047399 Adjacent sequences:  A004954 A004955 A004956 * A004958 A004959 A004960 KEYWORD nonn AUTHOR STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 30 08:43 EDT 2020. Contains 334712 sequences. (Running on oeis4.)