This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A285527 Number of super perfect rhythmic tilings of [0,3n-1] with triples. 4
 1, 1, 0, 0, 0, 0, 0, 0, 0, 18, 40, 66, 0, 0, 0, 0, 0, 0, 400686, 1738012, 8495580, 0, 0, 0, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,10 COMMENTS A super perfect tiling of the line with triples consists of n groups of three evenly spaced points, each group having a different common interval such that all points of the line are covered, and such that all intervals are inferior or equal to n (thus, each interval belongs to [1..n]). LINKS FORMULA For n>1, a(n) = A059108(n)*2 because A059108 ignores reflected solutions. - Fausto A. C. Cariboni, May 20 2017 EXAMPLE For n = 9, there are 18 tilings. One is: (0,2,4), (1,5,9), (3,11,19), (6,12,18), (7,14,21), (8,17,26), (10,13,16), (15,20,25), (22,23,24), with the intervals: 1,2,3,4,5,6,7,8,9 appearing in order: 2,4,8,6,7,9,3,5,1. It can also be represented as: 2 4 2 8 2 4 6 7 9 4 3 8 6 3 7 5 3 9 6 8 5 7 1 1 1 5 9 CROSSREFS Cf. A261516, A320392. Sequence in context: A039295 A043898 A231086 * A097972 A154284 A174264 Adjacent sequences:  A285524 A285525 A285526 * A285528 A285529 A285530 KEYWORD nonn,more AUTHOR Tony Reix, Apr 20 2017 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.

Last modified December 8 01:57 EST 2019. Contains 329850 sequences. (Running on oeis4.)