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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A004957 a(n) = ceiling(n*phi^2), where phi is the golden ratio, A001622. 8

%I

%S 0,3,6,8,11,14,16,19,21,24,27,29,32,35,37,40,42,45,48,50,53,55,58,61,

%T 63,66,69,71,74,76,79,82,84,87,90,92,95,97,100,103,105,108,110,113,

%U 116,118,121,124,126,129,131,134

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

%C A060142(a(n)) = 4 * A060142(n). - _Reinhard Zumkeller_, Nov 26 2012

%D 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.

%H Reinhard Zumkeller, <a href="/A004957/b004957.txt">Table of n, a(n) for n = 0..10000</a>

%o (Haskell)

%o import Data.List (findIndices)

%o a004957 n = a004957_list !! n

%o a004957_list = findIndices even a060142_list

%o -- _Reinhard Zumkeller_, Nov 26 2012

%Y Essentially same as A026352.

%K nonn

%O 0,2

%A _N. J. A. Sloane_

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 28 01:24 EST 2021. Contains 349396 sequences. (Running on oeis4.)