%I #16 Sep 08 2022 08:46:06
%S 1,385,769,1153,1537,1921,2305,2689,3073,3457,3841,4225,4609,4993,
%T 5377,5761,6145,6529,6913,7297,7681,8065,8449,8833,9217,9601,9985,
%U 10369,10753,11137,11521,11905,12289,12673,13057,13441,13825,14209,14593,14977,15361
%N 384*n + 1.
%C Every composite Fermat number has a divisor of the form 384*n + 1, n > 0.
%H Arkadiusz Wesolowski, <a href="/A229853/b229853.txt">Table of n, a(n) for n = 0..1000</a>
%H Wikipedia, <a href="http://en.wikipedia.org/wiki/Fermat_number">Fermat number</a>
%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).
%F G.f.: (1 + 383*x)/(1 - x)^2.
%p seq(384*n+1, n=0..40);
%t Table[384*n + 1, {n, 0, 40}]
%o (Magma) [384*n+1 : n in [0..40]]
%o (PARI) for(n=0, 40, print1(384*n+1, ", "));
%Y Cf. A000215, A094358, A229854-A229856.
%K nonn,easy
%O 0,2
%A _Arkadiusz Wesolowski_, Oct 01 2013