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.

A242396 Number of rows of equilateral triangles (sides length = 1) that intersect the circumference of a circle of radius n centered at (0,0) or (1/2,0).

This page as a plain text file.
%I A242396 #18 May 31 2014 14:49:39
%S A242396 4,6,8,10,12,14,18,20,22,24,26,28,32,34,36,38,40,42,44,48,50,52,54,56,
%T A242396 58,62,64,66,68,70,72,74,78,80,82,84,86,88,92,94,96,98,100,102,104,
%U A242396 108,110,112,114,116,118,122,124,126,128,130,132,134,138,140,142
%N A242396 Number of rows of equilateral triangles (sides length = 1) that intersect the circumference of a circle of radius n centered at (0,0) or (1/2,0).
%C A242396 See crossreferenced sequences for illustrations.
%F A242396 G.f., conjectured: (-2*x^14 + 4*x^13 + 2*x^12 + 2*x^11 + 2*x^10 + 2*x^9 + 2*x^8 + 4*x^7 + 2*x^6 + 2*x^5 + 2*x^4 + 2*x^3 + 2*x^2 + 4*x)/(x^14 - x^13 - x + 1). - _Ralf Stephan_, May 18 2014
%F A242396 Asymptotics from g.f.: a(n) ~ 30/13 * n. - _Ralf Stephan_, May 18 2014
%o A242396 (Small Basic)
%o A242396 For n =1 To 100
%o A242396   r6=n*math.Sin(30*Math.Pi/180)/(Math.Power(3,0.5)/2)
%o A242396   r6a=math.Round(r6)
%o A242396   If r6-math.Floor(r6) > 0.5 Then
%o A242396     a=r6a*4
%o A242396   Else
%o A242396     a=2*(r6a*2+1)
%o A242396   EndIf
%o A242396   TextWindow.Write(a+", ")
%o A242396 EndFor
%Y A242396 Cf. A242394, A242395.
%K A242396 nonn
%O A242396 1,1
%A A242396 _Kival Ngaokrajang_, May 13 2014