cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A183136 a(n) = [1/r]+[2/r]+...+[n/r], where r = golden ratio = (1+sqrt(5))/2 and []=floor.

Original entry on oeis.org

0, 1, 2, 4, 7, 10, 14, 18, 23, 29, 35, 42, 50, 58, 67, 76, 86, 97, 108, 120, 132, 145, 159, 173, 188, 204, 220, 237, 254, 272, 291, 310, 330, 351, 372, 394, 416, 439, 463, 487, 512, 537, 563, 590, 617, 645, 674, 703, 733, 763, 794, 826, 858
Offset: 1

Views

Author

Clark Kimberling, Dec 26 2010

Keywords

Comments

a(n) + A183137(n) = A000217(n) (the triangular numbers).

Examples

			The terms [k/r] are given by A060143 (and A005206): 0,1,1,2,3,3,4,4,5,6,6,7,8,8,...
		

Crossrefs

Programs

  • Mathematica
    Accumulate[Floor[Range[100]/GoldenRatio]] (* Paolo Xausa, Jun 20 2025 *)
  • PARI
    default(realprecision,100); r=(1+sqrt(5))/2; for(n=1,99, print1(sum(k=1,n,floor(k/r)), ", "))
    
  • Python
    from math import isqrt
    def A183136(n): return sum(isqrt(5*i**2)-i>>1 for i in range(1,n+1)) # Chai Wah Wu, Jun 20 2025

Formula

a(n) = [1/r]+[2/r]+...+[n/r], where r = golden ratio = (1+sqrt(5))/2 and []=floor.