OFFSET
0,7
COMMENTS
Conjecture: essentially partial sums of A169675 (verified for n <= 10000). - Sean A. Irvine, Jul 19 2022
LINKS
Nathaniel Johnston, Table of n, a(n) for n = 0..10000
C. F. Doran, M. G. Faux, S. J. Gates Jr, T. Hubsch, K. M. Iga and G. D. Landweber, Relating Doubly-Even Error-Correcting Codes, Graphs and Irreducible Representations of N-Extended Supersymmetry, arXiv:0806.0051 [hep-th], 2008. See formula (13) on page 6.
FORMULA
a(n) = 0 for 0 <= n < 4, a(n) = floor(((n-4)^2)/4)+1 for n = 4, 5, 6, 7, and a(n) = a(n-8) + 4 for n>7.
G.f.: x^4*(x^4+x^3+x^2+1) / ((x-1)^2*(x+1)*(x^2+1)*(x^4+1)). - Colin Barker, May 04 2013
MAPLE
A140427 := proc(n) local l: l:=[0, 0, 0, 0, 1, 1, 2, 3]: if(n<=7)then return l[n+1]:else return l[(n mod 8) + 1] + 4*floor(n/8): fi: end:
seq(A140427(n), n=0..62); # Nathaniel Johnston, Apr 26 2011
MATHEMATICA
a[n_] := Module[{L = {0, 0, 0, 0, 1, 1, 2, 3}}, If[n <= 7, L[[n + 1]], L[[Mod[n, 8] + 1]] + 4*Floor[n/8]]];
Table[a[n], {n, 0, 62}] (* Jean-François Alcover, Nov 28 2017, from Maple *)
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Jonathan Vos Post, Jun 18 2008
STATUS
approved