Philipolachi sequence

Very simple things, why do you have to recurrent ~~ # include using namespace std; int main () {INT i = 1, k = 1; do {i = i k; k = k i; cout << '<< i <<' '<< k;} while (k <= 32000);

#include using namespace std; int main () {double a [100]; int K = 0; A [0] = 1; a [1] = 1; for (; k <= 100; K ) {A [k 2] = a [k 1] a [k]; cout << a [k] << endl;}

}

INT F (INT I) {IF (i <1) return 0; if (1 == i) Return 1; RETURN F (I-1) F (I-2);}

#include using namespace std;

Void Fun (double * a, int N) {IF (a [N-2] <0.0001) Fun (A, N-1); IF (A [N-3] <0.0001) Fun (A, N-2) ; A [n-1] = a [n-2] a [n-3];} int main () {double a [100] = {1.0, 1.0}; Fun (a, 100); for (int i = 0; i <100; i ) {cout.width (15); cout << a [i]; if ((i 1)% 5 == 0) cout << endl;} return 0;}