Golf me the Schlosberg Numbers Schlosberg Numbers    

In issue 5 of Mathematical Reflections, Dorin Andrica proposed the problem of characterising the positive integers n such that  is an even integer. Eight people submitted correct solutions showing that these are the integers n for which  is even. The published solution was by Joel Schlosberg, so I call them the Schlosberg numbers.

These numbers may be found in OEIS as sequence A280682.

Your challenge is: given n, output the nth Schlosberg number. (0 or 1 indexed)

The first 50 Schlosberg numbers are:
0
4
5
6
7
8
16
17
18
19
20
21
22
23
24
36
37
38
39
40
41
42
43
44
45
46
47
48
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
100
101
102
103
104

Normal rules and the shortest code wins!
Haskell, 32 bytes



(filter(even.floor.sqrt)[0..]!!)


Try it online!