pell数列

#include
#include
using namespace std;
int Faction(int n)
{
if (n == 0)
return 0;
if (n == 1)
return 1;
if (n == 2)
return 2;
return 2 * Faction(n - 1) + Faction(n - 2);
}
int main()
{
int n = 0;
cin >> n;
vectorexp(n);
for (int& a : exp)
cin >> a;
for (int i = 0;i < n;i++)
{
int flag = Faction(exp[i]);
if (flag == 0)
cout << “得数为0,不能进行模操作”;
else
cout << flag % 32767;
}
return 0;
}