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

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A230276 Voids left after packing 5-curves coins patterns into fountain of coins with base n. 10
0, 1, 1, 6, 10, 16, 24, 34, 43, 57, 70, 85, 102, 121, 139, 162, 184, 208, 234, 262, 289, 321, 352, 385, 420, 457, 493, 534, 574, 616, 660, 706, 751, 801, 850, 901, 954, 1009, 1063, 1122, 1180, 1240, 1302, 1366, 1429 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

COMMENTS

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 each coin circumference and forms a continuous area. There are total 13 distinct patterns. For selected pattern, 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 A230267 and void left is a(n). See illustration in links.

LINKS

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

Kival Ngaokrajang, Illustration of initial terms (V)

Index entries for linear recurrences with constant coefficients, signature (1,1,0,-1,-1,1).

FORMULA

G.f.: x^2*(x^4 + 3*x^3 + 4*x^2 + 1)/((1-x)*(1-x^2)*(1-x^3)). - Ralf Stephan, Oct 17 2013

a(n) = (9*(-1)^n+18*n^2-48*n)/24 - A099837(n)/3. - R. J. Mathar, Feb 28 2018

MAPLE

A099837 := proc(n)

op(modp(n, 3)+1, [2, -1, -1]) ;

end proc:

A230276 := proc(n)

-A099837(n)/3 + (-48*n+31+18*n^2+9*(-1)^n)/24 ;

end proc:

seq(A230276(n), n=1..40) ; # R. J. Mathar, Feb 28 2018

PROG

(Small Basic)

a[1]=0

d[2]=1

For n = 1 To 100

If n+1 >= 3 Then

If Math.Remainder(n+1, 3)=math.Remainder(n+1, 6) Then

d2=2

Else

If Math.Remainder(n+1, 3)+math.Remainder(n+1, 6)=5 then

d2=5

Else

d2=-1

EndIf

EndIf

d[n+1]=d[n]+d2

EndIf

a[n+1]=a[n]+d[n+1]

TextWindow.Write(a[n]+", ")

EndFor

CROSSREFS

Cf. A008795 (3-curves coins patterns), A074148, A229093, A229154 (4-curves coins patterns), A001399 (5-curves coins patterns), A229593 (6-curves coins patterns).

Sequence in context: A315350 A340773 A114975 * A079329 A302748 A020741

Adjacent sequences: A230273 A230274 A230275 * A230277 A230278 A230279

KEYWORD

nonn,easy

AUTHOR

Kival Ngaokrajang, Oct 15 2013

STATUS

approved

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 December 8 21:28 EST 2022. Contains 358698 sequences. (Running on oeis4.)