|
%I #18 Feb 25 2018 22:59:38
%S 4,5,5,7,14,17,51,55,220,225,1125,1131,6786,6793,47551,47559,380472,
%T 380481,3424329,3424339,34243390,34243401,376677411,376677423,
%U 4520129076,4520129089,58761678157,58761678171,822663494394,822663494409,12339952416135,12339952416151,197439238658416
%N Add 1, multiply by 1, add 2, multiply by 2, etc.; start with 4.
%H Nick Hobson, <a href="/A082448/a082448.py.txt">Python program for this sequence</a>
%F For n>=2, a(2n)=floor((2e+4)*n!)-n-2, a(2n+1)=floor((2e+4)*n!)-1.
%t k = 0; NestList[(k++; {Last@# + k, k(k + Last@#)}) &, {4}, 16] // Flatten
%o (PARI) a=4; for(n=1,150,print(a,","); b=if(n%2-1,a*ceil(n/2),a+ceil(n/2)); a=b)
%o (PARI) A082448(n,a=4)={for(i=2,n+1,if(bittest(i,0),a*=i\2,a+=i\2));a} \\ _M. F. Hasler_, Feb 25 2018
%Y Cf. A019461 (same, but start with 0), A019463 (start with 1), A019460 (start with 2), A019462 (start with 3).
%Y Cf. A082458, A019464 .. A019466 (similar, but first multiply, then add).
%K nonn,easy
%O 0,1
%A _N. J. A. Sloane_, based on a suggestion of Nick MacDonald, Apr 25 2003
%E More terms from _Benoit Cloitre_, Apr 26 2003
%E Edited by _M. F. Hasler_, Feb 25 2018
|
