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!)
A054088 a(n) = A054086(3n); also a bisection of A003511. 7
2, 5, 8, 10, 13, 16, 19, 21, 24, 27, 30, 32, 35, 38, 40, 43, 46, 49, 51, 54, 57, 60, 62, 65, 68, 71, 73, 76, 79, 81, 84, 87, 90, 92, 95, 98, 101, 103, 106, 109, 112, 114, 117, 120, 122, 125, 128, 131, 133, 136, 139, 142, 144, 147, 150 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..55.

FORMULA

a(n) = floor( n*(1+sqrt(3)) ) = n + floor(n*sqrt(3)). - R. J. Mathar, Feb 26 2011

a(n) = n + A022838(n). - R. J. Mathar, Jan 25 2015

From Miko Labalan, Dec 17 2016: (Start)

For n > 0, a(n) = 3*floor(n*(sqrt(3)-1)) + 2*floor(n*(2-sqrt(3))) + 2;

a(0) = 0, a(n) = a(n - 1) + A022838(n) - A022838(n - 1) + 1. (End)

MAPLE

A054088 := proc(n) floor(n*(1+sqrt(3))) ; end proc: # R. J. Mathar, Feb 26 2011

MATHEMATICA

Table[Floor[n (1 + Sqrt[3])], {n, 100}] (* Wesley Ivan Hurt, Dec 17 2016 *)

PROG

(MAGMA) [3*Floor(n*(Sqrt(3)-1))+2*Floor(n*(2-Sqrt(3)))+2: n in [1..60]]; // Vincenzo Librandi, Dec 18 2016

CROSSREFS

Cf. A003511, A022838, A054086.

Sequence in context: A284774 A309095 A022843 * A186540 A059556 A248520

Adjacent sequences:  A054085 A054086 A054087 * A054089 A054090 A054091

KEYWORD

nonn,easy

AUTHOR

Clark Kimberling

EXTENSIONS

A-number in the definition corrected by R. J. Mathar, Oct 05 2008

STATUS

approved

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 June 24 21:09 EDT 2021. Contains 345425 sequences. (Running on oeis4.)