Hofstadter Q sequence

Submit

Language is selected by the extension of the file. See the list of supported languages to know the extension of your language.

Problem

The Hofstadter Q sequence is defined as:
q(1)=q(2)=1,
q(n)=q(n-q(n-1))+q(n-q(n-2)), n>2.

Print that the first 300 terms.

Options

exec is denied

now post-mortem time, all source codes will be revealed

Sample input:_

*NOTHING*

Sample output:

1
1
2
3
3
4
5
5
6
6
6
8
8
8
10
9
10
11
11
12
12
12
12
16
14
14
16
16
16
16
20
17
17
20
21
19
20
22
21
22
23
23
24
24
24
24
24
32
24
25
30
28
26
30
30
28
32
30
32
32
32
32
40
33
31
38
35
33
39
40
37
38
40
39
40
39
42
40
41
43
44
43
43
46
44
45
47
47
46
48
48
48
48
48
48
64
41
52
54
56
48
54
54
50
60
52
54
58
60
53
60
60
52
62
66
55
62
68
62
58
72
58
61
78
57
71
68
64
63
73
63
71
72
72
80
61
71
77
65
80
71
69
77
75
73
77
79
76
80
79
75
82
77
80
80
78
83
83
78
85
82
85
84
84
88
83
87
88
87
86
90
88
87
92
90
91
92
92
94
92
93
94
94
96
94
96
96
96
96
96
96
128
72
96
115
100
84
114
110
93
106
124
82
101
111
108
118
104
108
106
114
104
114
109
100
109
120
112
108
118
106
105
130
110
114
115
112
107
120
114
122
121
120
114
138
110
122
119
120
130
132
113
133
123
118
125
121
129
122
136
129
116
149
137
120
123
143
146
107
139
138
139
135
120
146
135
143
129
151
133
135
136
148
148
136
144
143
152
129
139
151
140
148
136
151
159
125
147
153
148
154
152
136
152
155
146
144
162
151
157

Ranking

Ruby _

Perl _

Python _

PHP _

Scheme _

Arc _

Io _

JavaScript _

Lua _

Xtal _

REXX _

BASIC _

J _

C _

Java _

Maxima _

Octave _

AWK _

bc _

dc _

Postscript _

R _

GolfScript _

gs2 _

Vim _

Groovy _

Language Ranking_

return to the top page