Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #19 Oct 28 2023 11:50:17
%S 0,15127,30254,45381,60508,75635,90762,105889,121016,136143,151270,
%T 166397,181524,196651,211778,226905,242032,257159,272286,287413,
%U 302540,317667,332794,347921,363048,378175,393302,408429,423556,438683,453810,468937,484064,499191,514318,529445,544572,559699
%N a(n) = round(n*phi^20), where phi is the golden ratio, A001622.
%C Not the same as A004975: a(n) != A004975(n) for n = 7564. [_Joerg Arndt_, Sep 17 2013]
%H Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/NonRecursions.html">Non Recursions</a>.
%t With[{g20=GoldenRatio^20},Round[Range[0,40]*g20]] (* _Harvey P. Dale_, Jun 11 2017 *)
%Y Cf. A001622, A004975.
%K nonn
%O 0,2
%A _N. J. A. Sloane_