login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A132292 Integers repeated 8 times: a(n) = floor((n-1)/8). 8

%I #64 Dec 31 2023 10:30:46

%S 0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,2,2,2,2,2,2,2,2,3,3,3,3,3,3,3,3,4,4,

%T 4,4,4,4,4,4,5,5,5,5,5,5,5,5,6,6,6,6,6,6,6,6,7,7,7,7,7,7,7,7,8,8,8,8,

%U 8,8,8,8,9,9,9,9,9,9,9,9,10,10,10,10,10,10,10,10

%N Integers repeated 8 times: a(n) = floor((n-1)/8).

%C Also floor((n^8-1)/(8*n^7)).

%F Also, a(n) = floor((n^8-n^7)/(8n^7-7n^6)). - _Mohammad K. Azarian_, Nov 18 2007

%F a(n) = A180969(3,n).

%F a(n) = (r - 8 + 4*sin(r*Pi/8))/16 where r = 2*n - 1 - 2*cos(n*Pi/2) - cos(n*Pi) + 2*sin(n*Pi/2). - _Wesley Ivan Hurt_, Oct 04 2018

%p A132292:=n->floor((n-1)/8); seq(A132292(n), n=1..100); # _Wesley Ivan Hurt_, Feb 27 2014

%t Table[Floor[(n-1)/8], {n, 100}] (* _Wesley Ivan Hurt_, Feb 27 2014 *)

%t Table[PadRight[{},8,n],{n,0,10}]//Flatten (* _Harvey P. Dale_, Apr 13 2020 *)

%o (PARI) a(n)=(n-1)\8 \\ _Charles R Greathouse IV_, Jun 18 2013

%o (Magma) [(n - 1) div 8 : n in [1..90]]; // _Vincenzo Librandi_, Oct 05 2018

%o (Python)

%o def A132292(n): return n-1>>3 # _Chai Wah Wu_, Jul 27 2022

%Y Cf. A004526, A002264, A002265, A002266, A054895.

%K nonn,easy

%O 1,17

%A _Mohammad K. Azarian_, Nov 06 2007

%E Offset corrected by _Mohammad K. Azarian_, Nov 20 2008

%E New name from _Wesley Ivan Hurt_, Jun 17 2013

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)