The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A306833 a(1) = 3; a(n+1) is the smallest k > a(n) such that 2^(k-1) == 1 (mod a(n)). 0
 3, 5, 9, 13, 25, 41, 61, 121, 221, 241, 265, 313, 469, 529, 760 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS This sequence is finite, the last term a(15) = 760 is even. Conjecture: for any initial term a(1), this recursion gives a finite sequence (ends with an even term). Theorem: for odd a(n), a(n+1) is even if and only if ord_{a(n)}(2) is odd and (a(n) mod ord_{a(n)}(2)) is odd. The set of penultimate terms of the sequences is {A036259} \ {A036260}. LINKS PROG (PARI) lista(nn) = {a = 3; print1(a, ", "); for (n=2, nn, k = a+1; while (Mod(2, a)^(k-1) != 1, k++); a = k; print1(a, ", "); if (!(a%2), break); ); } \\ Michel Marcus, Mar 24 2019 CROSSREFS Cf. A002326, A036259, A036260. Sequence in context: A144933 A133033 A145365 * A146433 A134672 A321024 Adjacent sequences:  A306830 A306831 A306832 * A306834 A306835 A306836 KEYWORD nonn,fini,full AUTHOR Thomas Ordowski, Mar 12 2019 STATUS approved

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

Last modified April 5 09:34 EDT 2020. Contains 333239 sequences. (Running on oeis4.)