Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include "stdafx.h"
- #include <iostream>
- #include <iomanip>
- using namespace std;
- long int factorial(int n)
- {
- if (n == 1 || n == 0) return 1;
- else return n* factorial(n - 1);
- }
- int main()
- {
- double l[100];
- l[0] = 0; //l[0] = 1
- l[1] = 1; //l[1] = 0
- l[2] = 0;
- l[3] = 1./12.; // l[3] = 0
- cout.setf(ios::fixed);
- for (int j = 2; j < 100; j++) {
- int sum = 0;
- for (int k = 1; k <= j; k++) {
- sum += ((j - k + 2)*(j - k + 1)*l[j - k + 2]) / factorial(k);
- }
- l[j + 2] = -(2*sum - j*l[j] + 6 * l[j - 2]) / ((1 + j)*(2 + j));
- }
- for (int i = 0; i < 100; i++) {
- cout << "l[" << i << "]\t" << setprecision(6) << l[i] << endl;
- }
- cout.unsetf(ios::fixed);
- getchar();
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement