|
| |
|
|
A004773
|
|
Congruent to 0, 1 or 2 mod 4.
|
|
15
| |
|
|
0, 1, 2, 4, 5, 6, 8, 9, 10, 12, 13, 14, 16, 17, 18, 20, 21, 22, 24, 25, 26, 28, 29, 30, 32, 33, 34, 36, 37, 38, 40, 41, 42, 44, 45, 46, 48, 49, 50, 52, 53, 54, 56, 57, 58, 60, 61, 62, 64, 65, 66, 68, 69, 70, 72, 73, 74, 76, 77, 78, 80, 81, 82, 84, 85, 86, 88, 89, 90
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,3
|
|
|
COMMENTS
| For n>1 this is identical to the sequence b(n) = floor((4/3)*(n+2)), which appears as an upper bound in Fijavz and Wood.
|
|
|
REFERENCES
| N. Graham and F. Harary, Edge Sums of Hypercubes, Bull. Irish Math. Soc. 21 (1988), 8-12
|
|
|
LINKS
| Gasper Fijavz, David R. Wood, Graph Minors and Minimum Degree, Dec 05, 2008. [From Jonathan Vos Post (jvospost3(AT)gmail.com), Dec 07 2008]
|
|
|
FORMULA
| Binary expansion does not end 11.
G.f.: (1+x+2*x^2)/((1-x)*(1-x^3)).
a(0) = 0, a(n+1) = a(n) + a(n) mod 4 + 0^(a(n) mod 4). - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Mar 23 2003
a(n) = A004396(n) + A004523(n); complement of A004767. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Aug 29 2005
a(n)=floor(n/3)+n [From Gary Detlefs (gdetlefs(AT)aol.com), Mar 20 2010]
|
|
|
MAPLE
| seq(floor(n/3)+n, n=0..68); [From Gary Detlefs (gdetlefs(AT)aol.com), Mar 20 2010]
|
|
|
MATHEMATICA
| f[n_] := Floor[4 n/3]; Array[f, 69, 0] (* or *)
fQ[n_] := Mod[n, 4] != 3; Select[ Range[0, 90], fQ] (* or *)
a[0] = 0; a[n_] := a[n] = a[n - 1] + 2 - If[ Mod[a[n - 1], 4] < 2, 1, 0]; Array[a, 69, 0] (* or )
CoefficientList[ Series[x (1 + x + 2 x^2)/((1 - x) (1 - x^3)), {x, 0, 68}], x]
|
|
|
PROG
| (MAGMA)[n: n in [0..100]|n mod 4 in {0, 1, 2}]][From Vincenzo Librandi, Dec 23 2010]
|
|
|
CROSSREFS
| Sequence in context: A049692 A047839 A139255 * A104401 A184421 A039070
Adjacent sequences: A004770 A004771 A004772 * A004774 A004775 A004776
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
