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!)
A257063 Number of length 1 1..(n+1) arrays with every leading partial sum divisible by 2 or 3. 1
1, 2, 3, 3, 4, 4, 5, 6, 7, 7, 8, 8, 9, 10, 11, 11, 12, 12, 13, 14, 15, 15, 16, 16, 17, 18, 19, 19, 20, 20, 21, 22, 23, 23, 24, 24, 25, 26, 27, 27, 28, 28, 29, 30, 31, 31, 32, 32, 33, 34, 35, 35, 36, 36, 37, 38, 39, 39, 40, 40, 41, 42, 43, 43, 44, 44, 45, 46, 47, 47, 48, 48, 49, 50, 51, 51 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

R. H. Hardin, Table of n, a(n) for n = 1..210

FORMULA

Empirical: a(n) = a(n-1) + a(n-6) - a(n-7).

Empirical for n mod 6 = 0: a(n) = (2/3)*n

Empirical for n mod 6 = 1: a(n) = (2/3)*n + (1/3)

Empirical for n mod 6 = 2: a(n) = (2/3)*n + (2/3)

Empirical for n mod 6 = 3: a(n) = (2/3)*n + 1

Empirical for n mod 6 = 4: a(n) = (2/3)*n + (1/3)

Empirical for n mod 6 = 5: a(n) = (2/3)*n + (2/3).

Empirical g.f.: x*(1 + x + x^2 + x^4) / ((1 - x)^2*(1 + x)*(1 - x + x^2)*(1 + x + x^2)). - Colin Barker, Dec 20 2018

EXAMPLE

All solutions for n=4:

..2....4....3

CROSSREFS

Row 1 of A257062.

Sequence in context: A057365 A014245 A096386 * A273663 A135671 A079420

Adjacent sequences:  A257060 A257061 A257062 * A257064 A257065 A257066

KEYWORD

nonn

AUTHOR

R. H. Hardin, Apr 15 2015

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 July 28 17:15 EDT 2021. Contains 346335 sequences. (Running on oeis4.)