[go: up one dir, main page]

login
Search: a069778 -id:a069778
     Sort: relevance | references | number | modified | created      Format: long | short | data
Connell sequence: 1 odd, 2 even, 3 odd, ...
(Formerly M0962 N0359)
+0
38
1, 2, 4, 5, 7, 9, 10, 12, 14, 16, 17, 19, 21, 23, 25, 26, 28, 30, 32, 34, 36, 37, 39, 41, 43, 45, 47, 49, 50, 52, 54, 56, 58, 60, 62, 64, 65, 67, 69, 71, 73, 75, 77, 79, 81, 82, 84, 86, 88, 90, 92, 94, 96, 98, 100, 101, 103, 105, 107, 109, 111, 113, 115, 117, 119, 121, 122
OFFSET
1,2
COMMENTS
Next (2n-1) odd numbers alternating with next 2n even numbers. Squares (A000290(n)) occur at the A000217(n)-th entry. - Lekraj Beedassy, Aug 06 2004. - Comment corrected by Daniel Forgues, Jul 18 2009
a(t_n) = a(n(n+1)/2) = n^2 relates squares to triangular numbers. - Daniel Forgues
The natural numbers not included are A118011(n) = 4n - a(n) as n=1,2,3,... - Paul D. Hanna, Apr 10 2006
As a triangle with row sums = A069778 (1, 6, 21, 52, 105, ...): /Q 1;/Q 2, 4;/Q 5, 7, 9;/Q 10, 12, 14, 16;/Q ... . - Gary W. Adamson, Sep 01 2008
The triangle sums, see A180662 for their definitions, link the Connell sequence A001614 as a triangle with six sequences, see the crossrefs. - Johannes W. Meijer, May 20 2011
a(n) = A122797(n) + n - 1. - Reinhard Zumkeller, Feb 12 2012
REFERENCES
C. Pickover, Computers and the Imagination, St. Martin's Press, NY, 1991, p. 276.
C. A. Pickover, The Mathematics of Oz, Chapter 39, Camb. Univ. Press UK 2002.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
Ian Connell and Andrew Korsak, Problem E1382, Amer. Math. Monthly, 67 (1960), 380.
Douglas E. Iannucci and Donna Mills-Taylor, On Generalizing the Connell Sequence, J. Integer Sequences, Vol. 2, 1999, #99.1.7.
H. P. Robinson and N. J. A. Sloane, Correspondence, 1971-1972
N. J. A. Sloane, Handwritten notes on Self-Generating Sequences, 1970 (note that A1148 has now become A005282)
Gary E. Stevens, A Connell-Like Sequence, J. Integer Sequences, Vol. 1, 1998, #98.1.4.
Eric Weisstein's World of Mathematics, Connell Sequence
FORMULA
a(n) = 2*n - floor( (1+ sqrt(8*n-7))/2 ).
a(n) = A005843(n) - A002024(n). - Lekraj Beedassy, Aug 06 2004
a(n) = A118012(A118011(n)). A117384( a(n) ) = n; A117384( 4*n - a(n) ) = n. - Paul D. Hanna, Apr 10 2006
a(1) = 1; then a(n) = a(n-1)+1 if a(n-1) is a square, a(n) = a(n-1)+2 otherwise. For example, a(21)=36 is a square therefore a(22)=36+1=37 which is not a square so a(23)=37+2=39 ... - Benoit Cloitre, Feb 07 2007
T(n,k) = (n-1)^2 + 2*k - 1. - Omar E. Pol, Aug 13 2013
a(n)^2 = a(n*(n+1)/2). - Ivan N. Ianakiev, Aug 15 2013
Let the sequence be written in the form of the triangle in the EXAMPLE section below and let a(n) and a(n+1) belong to the same row of the triangle. Then a(n)*a(n+1) + 1 = a(A000217(A118011(n))) = A000290(A118011(n)). - Ivan N. Ianakiev, Aug 16 2013
a(n) = 2*n-round(sqrt(2*n)). - Gerald Hillier, Apr 15 2015
From Robert Israel, Apr 20 2015 (Start):
G.f. 2*x/(1-x)^2 - (x/(1-x))*sum(n>=0, x^(n*(n+1)/2))
= 2*x/(1-x)^2 - (Theta2(0,x^(1/2)))*x^(7/8)/(2*(1-x)) where Theta2 is a Jacobi theta function.
a(n) = 2*n-1 - Sum(i=0..n-2, A023531(i)). (End)
EXAMPLE
From Omar E. Pol, Aug 13 2013: (Start)
Written as a triangle the sequence begins:
1;
2, 4;
5, 7, 9;
10, 12, 14, 16;
17, 19, 21, 23, 25;
26, 28, 30, 32, 34, 36;
37, 39, 41, 43, 45, 47, 49;
50, 52, 54, 56, 58, 60, 62, 64;
65, 67, 69, 71, 73, 75, 77, 79, 81;
82, 84, 86, 88, 90, 92, 94, 96, 98, 100;
...
Right border gives A000290, n >= 1.
(End)
MAPLE
A001614:=proc(n): 2*n - floor((1+sqrt(8*n-7))/2) end: seq(A001614(n), n=1..67); # Johannes W. Meijer, May 20 2011
MATHEMATICA
lst={}; i=0; For[j=1, j<=4!, a=i+1; b=j; k=0; For[i=a, i<=9!, k++; AppendTo[lst, i]; If[k>=b, Break[]]; i=i+2]; j++ ]; lst (* Vladimir Joseph Stephan Orlovsky, Aug 29 2008 *)
row[n_] := 2*Range[n+1]+n^2-1; Table[row[n], {n, 0, 11}] // Flatten (* Jean-François Alcover, Oct 25 2013 *)
PROG
(Haskell)
a001614 n = a001614_list !! (n-1)
a001614_list = f 0 0 a057211_list where
f c z (x:xs) = z' : f x z' xs where z' = z + 1 + 0 ^ abs (x - c)
-- Reinhard Zumkeller, Dec 30 2011
(Magma) [2*n-Round(Sqrt(2*n)): n in [1..80]]; // Vincenzo Librandi, Apr 17 2015
(PARI) a(n)=2*n - round(sqrt(2*n)) \\ Charles R Greathouse IV, Apr 20 2015
(Python)
from math import isqrt
def A001614(n): return (m:=n<<1)-(k:=isqrt(m))-int((m<<2)>(k<<2)*(k+1)+1) # Chai Wah Wu, Jul 26 2022
CROSSREFS
Cf. A117384, A118011 (complement), A118012.
Cf. A069778. - Gary W. Adamson, Sep 01 2008
From Johannes W. Meijer, May 20 2011: (Start)
Triangle columns: A002522, A117950 (n>=1), A117951 (n>=2), A117619 (n>=3), A154533 (n>=5), A000290 (n>=1), A008865 (n>=2), A028347 (n>=3), A028878 (n>=1), A028884 (n>=2), A054569 [T(2*n,n)].
Triangle sums (see the comments): A069778 (Row1), A190716 (Row2), A058187 (Related to Kn11, Kn12, Kn13, Kn21, Kn22, Kn23, Fi1, Fi2, Ze1 and Ze2), A000292 (Related to Kn3, Kn4, Ca3, Ca4, Gi3 and Gi4), A190717 (Related to Ca1, Ca2, Ze3, Ze4), A190718 (Related to Gi1 and Gi2). (End)
KEYWORD
nonn,easy,nice,tabl
EXTENSIONS
More terms from Larry Reeves (larryr(AT)acm.org), Mar 16 2001
STATUS
approved
Array of q-factorial numbers n!_q, read by ascending antidiagonals.
+0
19
1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 6, 3, 1, 1, 1, 24, 21, 4, 1, 1, 1, 120, 315, 52, 5, 1, 1, 1, 720, 9765, 2080, 105, 6, 1, 1, 1, 5040, 615195, 251680, 8925, 186, 7, 1, 1, 1, 40320, 78129765, 91611520, 3043425, 29016, 301, 8, 1, 1
OFFSET
0,8
LINKS
Kent E. Morrison, Integer Sequences and Matrices Over Finite Fields, Journal of Integer Sequences, Vol. 9 (2006), Article 06.2.1.
FORMULA
T(n,q) = Product_{k=1..n} (q^k - 1) / (q - 1).
T(n,k) = Product_{n1=k..n-1} A104878(n1,k). - Johannes W. Meijer, Aug 21 2011
EXAMPLE
Square array begins:
1, 1, 1, 1, 1, 1, 1, ...
1, 1, 1, 1, 1, 1, 1, ...
1, 2, 3, 4, 5, 6, 7, ...
1, 6, 21, 52, 105, 186, 301, ...
1, 24, 315, 2080, 8925, 29016, 77959, ...
1, 120, 9765, 251680, 3043425, 22661496, 121226245, ...
...
MAPLE
A069777 := proc(n, k) local n1: mul(A104878(n1, k), n1=k..n-1) end: A104878 := proc(n, k): if k = 0 then 1 elif k=1 then n elif k>=2 then (k^(n-k+1)-1)/(k-1) fi: end: seq(seq(A069777(n, k), k=0..n), n=0..9); # Johannes W. Meijer, Aug 21 2011
nmax:=9: T(0, 0):=1: for n from 1 to nmax do T(n, 0):=1: T(n, 1):= (n-1)! od: for q from 2 to nmax do for n from 0 to nmax do T(n+q, q) := product((q^k - 1)/(q - 1), k= 1..n) od: od: for n from 0 to nmax do seq(T(n, k), k=0..n) od; seq(seq(T(n, k), k=0..n), n=0..nmax); # Johannes W. Meijer, Aug 21 2011
# alternative Maple program:
T:= proc(n, k) option remember; `if`(n<2, 1,
T(n-1, k)*`if`(k=1, n, (k^n-1)/(k-1)))
end:
seq(seq(T(d-k, k), k=0..d), d=0..10); # Alois P. Heinz, Sep 08 2021
MATHEMATICA
(* Returns the rectangular array *) Table[Table[QFactorial[n, q], {q, 0, 6}], {n, 0, 6}] (* Geoffrey Critzer, May 21 2017 *)
PROG
(PARI) T(n, q)=prod(k=1, n, ((q^k - 1) / (q - 1))) \\ Andrew Howroyd, Feb 19 2018
CROSSREFS
Rows n=3..5 are A069778, A069779, A218503.
Main diagonal gives A347611.
Cf. A156173.
KEYWORD
easy,nonn,tabl
AUTHOR
EXTENSIONS
Name edited by Michel Marcus, Sep 08 2021
STATUS
approved
q-factorial numbers 4!_q.
+0
3
1, 24, 315, 2080, 8925, 29016, 77959, 182400, 384345, 746200, 1356531, 2336544, 3847285, 6097560, 9352575, 13943296, 20276529, 28845720, 40242475, 55168800, 74450061, 99048664, 130078455, 168819840, 216735625, 275487576, 346953699, 433246240, 536730405, 660043800
OFFSET
0,2
FORMULA
a(n) = (n + 1)*(n^2 + n + 1)*(n^3 + n^2 + n + 1).
G.f.: (1 + 17*x + 8*x^2*(21 + 43*x) + 5*x^4*(35 + 3*x))/(1 - x)^7. - Arkadiusz Wesolowski, Nov 01 2012
MATHEMATICA
Table[QFactorial[4, n], {n, 0, 29}] (* Arkadiusz Wesolowski, Nov 01 2012 *)
LinearRecurrence[{7, -21, 35, -35, 21, -7, 1}, {1, 24, 315, 2080, 8925, 29016, 77959}, 30] (* Harvey P. Dale, Aug 30 2020 *)
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
STATUS
approved
Triangle read by rows in which row n consists of the first n+1 n-gonal numbers.
+0
9
1, 1, 1, 1, 2, 3, 1, 3, 6, 10, 1, 4, 9, 16, 25, 1, 5, 12, 22, 35, 51, 1, 6, 15, 28, 45, 66, 91, 1, 7, 18, 34, 55, 81, 112, 148, 1, 8, 21, 40, 65, 96, 133, 176, 225, 1, 9, 24, 46, 75, 111, 154, 204, 261, 325, 1, 10, 27, 52, 85, 126, 175, 232, 297, 370, 451
OFFSET
0,5
LINKS
Eric Weisstein's World of Mathematics, Polygonal Number
FORMULA
Array of coefficients of x in the expansions of T(k, x) = (1 + k*x -(k-2)*x^2)/(1-x)^4, k > -4.
T(n, k) = k*((n-2)*k -(n-4))/2 (see MathWorld link). - Michel Marcus, Jun 22 2015
EXAMPLE
The array starts
1 1 3 10 ...
1 2 6 16 ...
1 3 9 22 ...
1 4 12 28 ...
The triangle starts
1;
1, 1;
1, 2, 3;
1, 3, 6, 10;
1, 4, 9, 16, 25;
...
MATHEMATICA
Table[PolygonalNumber[n, i], {n, 0, 10}, {i, n+1}]//Flatten (* Requires Mathematica version 10.4 or later *) (* Harvey P. Dale, Aug 27 2016 *)
PROG
(PARI) tabl(nn) = {for (n=0, nn, for (k=1, n+1, print1(k*((n-2)*k-(n-4))/2, ", "); ); print(); ); } \\ Michel Marcus, Jun 22 2015
(Magma) [[k*((n-2)*k-(n-4))/2: k in [1..n+1]]: n in [0..10]]; // G. C. Greubel, Oct 13 2018
(Sage) [[k*((n-2)*k -(n-4))/2 for k in (1..n+1)] for n in (0..10)] # G. C. Greubel, Aug 14 2019
(GAP) Flat(List([0..10], n-> List([1..n+1], k-> k*((n-2)*k-(n-4))/2 ))); # G. C. Greubel, Aug 14 2019
CROSSREFS
Antidiagonals are composed of n-gonal numbers.
KEYWORD
easy,nonn,tabl,look
AUTHOR
Paul Barry, Mar 21 2003
STATUS
approved
Array read by antidiagonals: number of {112,221}-avoiding words.
+0
4
1, 1, 2, 1, 4, 3, 1, 6, 9, 4, 1, 6, 21, 16, 5, 1, 6, 33, 52, 25, 6, 1, 6, 33, 124, 105, 36, 7, 1, 6, 33, 196, 345, 186, 49, 8, 1, 6, 33, 196, 825, 786, 301, 64, 9, 1, 6, 33, 196, 1305, 2586, 1561, 456, 81, 10, 1, 6, 33, 196, 1305, 6186, 6601, 2808, 657, 100, 11
OFFSET
1,3
COMMENTS
A(n,k) is the number of n-long k-ary words that simultaneously avoid the patterns 112 and 221.
LINKS
A. Burstein and T. Mansour, Words restricted by patterns with at most 2 distinct letters, arXiv:math/0110056 [math.CO], 2001.
FORMULA
A(n, k) = k!*binomial(n, k) + Sum_{j=1..k-1} j*j!*binomial(n, j), for 2 <= k <= n, otherwise Sum_{j=1..n} j*j!*binomial(n, j), with A(1, k) = 1 and A(n, 1) = n.
From G. C. Greubel, Dec 29 2021: (Start)
T(n, k) = A(k, n-k+1).
Sum_{k=1..n} T(n, k) = A093963(n).
T(n, 1) = 1.
T(n, n) = n.
T(n, n-1) = (n-1)^2.
T(n, n-2) = A069778(n).
T(2*n-1, n) = A093965(n).
T(2*n, n) = A093964(n), for n >= 1. (End)
EXAMPLE
Array, A(n, k), begins as:
1, 1, 1, 1, 1, 1, 1 ... 1*A000012(k);
2, 4, 6, 6, 6, 6, 6 ... 2*A158799(k-1);
3, 9, 21, 33, 33, 33, 33 ... ;
4, 16, 52, 124, 196, 196, 196 ... ;
5, 25, 105, 345, 825, 1305, 1305 ... ;
6, 36, 186, 786, 2586, 6186, 9786 ... ;
7, 49, 301, 1561, 6601, 21721, 51961 ... ;
Antidiagonal triangle, T(n, k), begins as:
1;
1, 2;
1, 4, 3;
1, 6, 9, 4;
1, 6, 21, 16, 5;
1, 6, 33, 52, 25, 6;
1, 6, 33, 124, 105, 36, 7;
1, 6, 33, 196, 345, 186, 49, 8;
1, 6, 33, 196, 825, 786, 301, 64, 9;
1, 6, 33, 196, 1305, 2586, 1561, 456, 81, 10;
MATHEMATICA
A[n_, k_]:= A[n, k]= If[n==1, 1, If[k==1, n, If[2<=k<n+1, (1-k)*k!*Binomial[n, k] + Sum[j*j!*Binomial[n, j], {j, k}], Sum[j*j!*Binomial[n, j], {j, n}] ]]];
T[n_, k_]:= A[k, n-k+1];
Table[T[k, k], {n, 15}, {k, n}]//Flatten (* G. C. Greubel, Dec 29 2021 *)
PROG
(PARI) A(n, k) = if(n >= k+1, sum(j=1, k, j*j!*binomial(k, j)), if(n<2, if(n<1, 0, k), n!*binomial(k, n) + sum(j=1, n-1, j*j!*binomial(k, j))));
T(n, k) = A(n-k+1, k);
for(n=1, 15, for(k=1, n, print1(T(n, k), ", ") ) )
(Sage)
@CachedFunction
def A(n, k):
if (n==1): return 1
elif (k==1): return n
elif (2 <= k < n+1): return factorial(k)*binomial(n, k) + sum( j*factorial(j)*binomial(n, j) for j in (1..k-1) )
else: return sum( j*factorial(j)*binomial(n, j) for j in (1..n) )
def T(n, k): return A(k, n-k+1)
flatten([[T(n, k) for k in (1..n)] for n in (1..15)]) # G. C. Greubel, Dec 29 2021
CROSSREFS
Cf. A069778, A093963 (antidiagonal sums), A093964, A093965 (main diagonal).
KEYWORD
nonn,tabl
AUTHOR
Ralf Stephan, Apr 20 2004
STATUS
approved
Triangle read by rows: T(i,j) = (T(i-1,j) + i)*i.
+0
2
1, 6, 4, 27, 21, 9, 124, 100, 52, 16, 645, 525, 285, 105, 25, 3906, 3186, 1746, 666, 186, 36, 27391, 22351, 12271, 4711, 1351, 301, 49, 219192, 178872, 98232, 37752, 10872, 2472, 456, 64, 1972809, 1609929, 884169, 339849, 97929, 22329, 4185, 657, 81, 19728190, 16099390, 8841790, 3398590, 979390, 223390, 41950, 6670, 910, 100
OFFSET
1,2
COMMENTS
The first column is A030297 = a(n) = n*(n+a(n-1)). The main diagonal are the squares A000290 = n^2. The first lower diagonal (6,21,52,...) is A069778 = q-factorial numbers 3!_q. See also A121662.
REFERENCES
T. A. Gulliver, Sequences from Cubes of Integers, Int. Math. Journal, 4 (2003), 439-445.
EXAMPLE
Triangle begins:
1
6 4
27 21 9
124 100 52 16
645 525 285 105 25
3906 3186 1746 666 186 36
27391 22351 12271 4711 1351 301 49
...
MAPLE
T:= proc(i, j) option remember;
`if`(j<1 or j>i, 0, (T(i-1, j)+i)*i)
end:
seq(seq(T(n, k), k=1..n), n=1..10); # Alois P. Heinz, Jun 22 2022
MATHEMATICA
T[n_, k_] /; 1 <= k <= n := T[n, k] = (T[n-1, k]+n)*n;
T[_, _] = 0;
Table[T[n, k], {n, 1, 10}, {k, 1, n}] // Flatten (* Jean-François Alcover, Nov 17 2022 *)
PROG
(Python)
def T(i, j): return (T(i-1, j)+i)*i if 1 <= j <= i else 0
print([T(r, c) for r in range(1, 11) for c in range(1, r+1)]) # Michael S. Branicky, Jun 22 2022
CROSSREFS
Row sums give A337001.
KEYWORD
nonn,tabl
AUTHOR
Thomas Wieder, Aug 15 2006
EXTENSIONS
Edited by N. J. A. Sloane, Sep 15 2006
Formula in name corrected by Alois P. Heinz, Jun 22 2022
STATUS
approved
a(n) = n^3-(n+1)^2.
+0
6
-1, -3, -1, 11, 39, 89, 167, 279, 431, 629, 879, 1187, 1559, 2001, 2519, 3119, 3807, 4589, 5471, 6459, 7559, 8777, 10119, 11591, 13199, 14949, 16847, 18899, 21111, 23489, 26039, 28767, 31679, 34781, 38079, 41579, 45287, 49209, 53351, 57719
OFFSET
0,2
MATHEMATICA
Table[n^3-(n+1)^2, {n, 0, 40}] (* Harvey P. Dale, Oct 05 2022 *)
CROSSREFS
KEYWORD
sign
AUTHOR
STATUS
approved
n^3 - (n+2)^2.
+0
2
-4, -8, -8, 2, 28, 76, 152, 262, 412, 608, 856, 1162, 1532, 1972, 2488, 3086, 3772, 4552, 5432, 6418, 7516, 8732, 10072, 11542, 13148, 14896, 16792, 18842, 21052, 23428, 25976, 28702, 31612, 34712, 38008, 41506, 45212, 49132, 53272, 57638
OFFSET
1,1
FORMULA
G.f.: 2*x*(x^3+4*x-2)/(x-1)^4. [Colin Barker, Oct 08 2012]
MATHEMATICA
a[n_] := n^3-(n+2)^2; lst={}; Do[AppendTo[lst, a[n]], {n, 0, 5!}]; lst
CROSSREFS
KEYWORD
sign,easy
AUTHOR
STATUS
approved
a(n)=n^3-(3*(n+3))^2.
+0
2
-81, -143, -217, -297, -377, -451, -513, -557, -577, -567, -521, -433, -297, -107, 143, 459, 847, 1313, 1863, 2503, 3239, 4077, 5023, 6083, 7263, 8569, 10007, 11583, 13303, 15173, 17199, 19387, 21743, 24273, 26983, 29879, 32967, 36253, 39743
OFFSET
1,1
FORMULA
a(1)=-81, a(2)=-143, a(3)=-217, a(4)=-297, a(n)=4*a(n-1)-6*a(n-2)+ 4*a(n-3)- a(n-4). - Harvey P. Dale, Jul 10 2013
MATHEMATICA
a[n_]:=n^3-(3*(n+3))^2; lst={}; Do[AppendTo[lst, a[n]], {n, 0, 5!}]; lst
Table[n^3-(3(n+3))^2, {n, 0, 40}] (* or *) LinearRecurrence[{4, -6, 4, -1}, {-81, -143, -217, -297}, 40] (* Harvey P. Dale, Jul 10 2013 *)
PROG
(PARI) a(n)=n^3-(3*n+9)^2 \\ Charles R Greathouse IV, Oct 18 2022
CROSSREFS
KEYWORD
sign,easy
AUTHOR
STATUS
approved
a(n) = n^3 - 3*(n+3)^2.
+0
1
-27, -47, -67, -81, -83, -67, -27, 43, 149, 297, 493, 743, 1053, 1429, 1877, 2403, 3013, 3713, 4509, 5407, 6413, 7533, 8773, 10139, 11637, 13273, 15053, 16983, 19069, 21317, 23733, 26323, 29093, 32049, 35197, 38543, 42093, 45853, 49829, 54027
OFFSET
0,1
FORMULA
a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) - a(n-4); a(0)=-27, a(1)=-47, a(2)=-67, a(3)=-81. - Harvey P. Dale, Aug 24 2011
G.f.: (x*(x*(13*x - 41) + 61) - 27)/(x-1)^4. - Harvey P. Dale, Aug 24 2011
E.g.f.: (-27 - 20*x + x^3)*exp(x). - G. C. Greubel, Nov 10 2018
MATHEMATICA
a[n_]:=n^3-3*(n+3)^2; a/@ Range[0, 50]
Table[n^3-3(n+3)^2, {n, 0, 50}] (* or *) LinearRecurrence[{4, -6, 4, -1}, {-27, -47, -67, -81}, 51] (* Harvey P. Dale, Aug 24 2011 *)
PROG
(Magma)[n^3-3*(n+3)^2: n in [0..40] ]; // Vincenzo Librandi, Aug 25 2011
(PARI) vector(40, n, n--; n^3-3*(n+3)^2) \\ G. C. Greubel, Nov 10 2018
KEYWORD
sign,easy
AUTHOR
EXTENSIONS
Offset changed from 1 to 0 by Vincenzo Librandi, Aug 25 2011
STATUS
approved

Search completed in 0.012 seconds