1959–60 Hellenic Football League
The 1959–60 Hellenic Football League season was the seventh in the history of the Hellenic Football League, a football competition in England.
Premier Division
Season | 1959–60 |
---|---|
Champions | Abingdon Town |
Relegated | Chipping Norton Town |
Matches played | 272 |
Goals scored | 1,320 (4.85 per match) |
← 1958–59 1960–61 → |
The Premier Division featured 14 clubs which competed in the division last season, along with three new clubs:
- Swindon Town 'A'
- Thatcham, promoted from Division One
- Thame United
League table
Pos | Team | Pld | W | D | L | GF | GA | GR | Pts | Promotion or relegation |
---|---|---|---|---|---|---|---|---|---|---|
1 | Abingdon Town | 32 | 22 | 6 | 4 | 96 | 29 | 3.310 | 50 | |
2 | Swindon Town 'A' | 32 | 22 | 2 | 8 | 95 | 44 | 2.159 | 46 | |
3 | Bicester Town | 32 | 20 | 3 | 9 | 89 | 65 | 1.369 | 43 | |
4 | Luton Town Colts | 32 | 19 | 3 | 10 | 100 | 64 | 1.563 | 41 | Resigned from the league |
5 | Thatcham | 32 | 18 | 4 | 10 | 92 | 59 | 1.559 | 40 | |
6 | Hungerford Town | 32 | 17 | 6 | 9 | 95 | 81 | 1.173 | 40 | |
7 | Headington United reserves | 32 | 13 | 9 | 10 | 98 | 70 | 1.400 | 35 | |
8 | Witney Town | 32 | 13 | 7 | 12 | 82 | 71 | 1.155 | 33 | |
9 | Stokenchurch | 32 | 16 | 1 | 15 | 79 | 78 | 1.013 | 33 | |
10 | Thame United | 32 | 14 | 4 | 14 | 84 | 76 | 1.105 | 32 | |
11 | Newbury Town reserves | 32 | 14 | 4 | 14 | 68 | 78 | 0.872 | 32 | |
12 | Wallingford Town | 32 | 13 | 4 | 15 | 64 | 86 | 0.744 | 30 | |
13 | Pressed Steel | 32 | 11 | 3 | 18 | 59 | 97 | 0.608 | 25 | |
14 | Amersham Town | 32 | 9 | 4 | 19 | 60 | 93 | 0.645 | 22 | |
15 | Kidlington | 32 | 9 | 4 | 19 | 64 | 106 | 0.604 | 22 | |
16 | Wantage Town | 32 | 5 | 3 | 24 | 52 | 120 | 0.433 | 13 | |
17 | Chipping Norton Town | 32 | 2 | 3 | 27 | 43 | 103 | 0.417 | 7 | Relegated to Division One |
Source: nonleaguematters
Rules for classification: 1) points; 2) goal ratio; 3) number of goals scored.
Rules for classification: 1) points; 2) goal ratio; 3) number of goals scored.
gollark: ```haskell(....) :: ((a1 -> (a1 -> b) -> c) -> c) -> (((a1 -> b) -> a1 -> (a1 -> b) -> a1 -> (a1 -> b) -> c) -> a1 -> b) -> (a2 -> (a1 -> b) -> a1 -> (a1 -> b) -> a1 -> (a1 -> b) -> c) -> a2 -> c(....) = ((.) .)<$> (*>) (. (.)) (<*>) . ((.) >>= (. ((.) . (.)))) . ((>>) >> (<$>))```
gollark: Wow, it is very slow.
gollark: Let's make some ~~pointless~~ pointfree code!
gollark: ```haskell(...) = (.) . (. (.)) . (.) . (. (. (.))) . ((.) .)``````haskell(...) :: (((b1 -> c1) -> c2) -> b2 -> c3) -> (a1 -> b3 -> c2) -> a1 -> (((a2 -> b1) -> a2 -> c1) -> b3) -> (a3 -> b2) -> a3 -> c3```
gollark: Oh, that.
References
External links
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.