# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a230267
Showing 1-1 of 1

%I A230267 #18 Oct 22 2013 12:42:48
%S A230267 1,3,2,6,7,9,12,16,17,23,26,30,35,41,44,52,57,63,70,78,83,93,100,108,
%T A230267 117,127,134,146,155,165,176,188,197,211,222,234,247,261,272,288,301,
%U A230267 315,330,346,359,377,392,408,425,443
%N A230267 Coins left after packing 5 curves coins patterns into fountain of coins base n.
%C A230267 Refer to arrangement same as A005169: "A fountain is formed by starting with a row of coins, then stacking additional coins on top so that each new coin touches two in the previous row". The 5 curves coins patterns consist of a part of circumference and forms continuous area. There is total 13 distinct patterns. I would like to call "5C4S" type as it cover 4 coins and symmetry. When packing 5C4S into fountain of coins base n, the total number of 5C4S is A001399, the coins left is a(n) and void is A230276. See illustration in links.
%H A230267 Kival Ngaokrajang, <a href="/A230267/a230267.pdf">Illustration of initial terms (U)</a>
%F A230267 G.f.: x*(x^3 - 2*x^2 + 2*x + 1)/((1-x)*(1-x^2)*(1-x^3)) (conjectured). - _Ralf Stephan_, Oct 17 2013
%o A230267 (Small Basic)
%o A230267 a[1]=1
%o A230267 d[2]=2
%o A230267 For n = 1 To 100
%o A230267   If n+1 >= 3 Then
%o A230267     If Math.Remainder(n+1,3)=math.Remainder(n+1,6) Then
%o A230267       d2=1
%o A230267     Else
%o A230267       d2=Math.Remainder(n+1,3)+math.Remainder(n+1,6)*Math.Power(-1,math.Remainder(n+1,2))
%o A230267     EndIf
%o A230267     d[n+1]=d[n]+d2
%o A230267   EndIf
%o A230267   a[n+1]=a[n]+d[n+1]
%o A230267 TextWindow.Write(a[n]+", ")
%o A230267 EndFor
%Y A230267 Cf. A008795 (3-curves coins patterns), A074148, A229093, A229154 (4-curves coins patterns), A001399 (5-curves coins patterns), A229593 (6-curves coins patterns).
%K A230267 nonn
%O A230267 1,2
%A A230267 _Kival Ngaokrajang_, Oct 15 2013

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE