login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A195177 3*n-floor(2*n*sqrt(2)). 1

%I

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

%T 6,7,7,7,7,7,7,8,8,8,8,8,8,9,9,9,9,9,9,10,10,10,10,10,10,11,11,11,11,

%U 11,11,12,12,12,12,12,13,13,13,13,13,13,14,14,14,14,14,14,15,15

%N 3*n-floor(2*n*sqrt(2)).

%H Vincenzo Librandi, <a href="/A195177/b195177.txt">Table of n, a(n) for n = 0..10000</a>

%F a(n)=3n-A022842(n). - _R. J. Mathar_, Jan 10 2013

%o (MAGMA) [3*n-Floor(2*n*(Sqrt(2))): n in [0..70]]; // Vincenzo Librandi, Sep 12 2011

%K nonn

%O 0,7

%A _Clark Kimberling_, Sep 10 2011

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified May 22 09:19 EDT 2013. Contains 225516 sequences.