login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A290650 a(1) = 1. For n > 1, a(n) = a(n-1)/2 if a(n-1) is even, a(n) = a(n-1)*n otherwise. 1
1, 2, 1, 4, 2, 1, 7, 56, 28, 14, 7, 84, 42, 21, 315, 5040, 2520, 1260, 630, 315, 6615, 145530, 72765, 1746360, 873180, 436590, 218295, 6112260, 3056130, 1528065, 47370015, 1515840480, 757920240, 378960120 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Conjecture: The sequence is unbounded. - Felix Fröhlich, Aug 08 2017
LINKS
MATHEMATICA
nxt[{n_, a_}]:={n+1, If[EvenQ[a], a/2, a(n+1)]}; NestList[nxt, {1, 1}, 40][[All, 2]] (* Harvey P. Dale, Dec 23 2020 *)
PROG
(PARI) terms(n) = my(x=1, k=1, i=0); while(1, if(i==n, break, if(i==0, print1(x, ", "); k++; i++, if(x%2==0, x=x/2; k++, x=x*k; k++); print1(x, ", "); i++)))
/* Print initial 40 terms as follows */
terms(40) \\ Felix Fröhlich, Aug 08 2017
CROSSREFS
Sequence in context: A134586 A135287 A359803 * A346874 A348533 A089606
KEYWORD
nonn
AUTHOR
John Bailey, Aug 08 2017
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 04:35 EDT 2024. Contains 371782 sequences. (Running on oeis4.)