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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A369302 a(n) = A091255(A369293(n), A369293(n+1)). 2
 1, 2, 2, 3, 3, 3, 7, 7, 2, 2, 6, 3, 15, 3, 2, 4, 2, 11, 11, 3, 13, 13, 2, 3, 7, 7, 2, 2, 2, 3, 31, 31, 2, 7, 7, 2, 19, 19, 3, 5, 3, 25, 25, 2, 2, 3, 3, 3, 5, 7, 7, 4, 13, 3, 6, 3, 63, 3, 2, 4, 2, 14, 3, 61, 61, 2, 37, 37, 3, 3, 59, 59, 2, 2, 11, 11, 7, 7, 4, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS All terms, except the first, are > 1. LINKS Rémy Sigrist, Table of n, a(n) for n = 1..10000 Rémy Sigrist, PARI program Index entries for sequences operating on GF(2)[X]-polynomials EXAMPLE a(42) = A091255(A369293(42), A369293(43)) = A091255(43, 25) = 25. PROG (PARI) See Links section. CROSSREFS Cf. A073734, A091255, A369293. Sequence in context: A025496 A099959 A099964 * A363826 A094440 A093736 Adjacent sequences: A369299 A369300 A369301 * A369303 A369304 A369305 KEYWORD nonn,base AUTHOR Rémy Sigrist, Jan 19 2024 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.

Last modified August 2 19:53 EDT 2024. Contains 374875 sequences. (Running on oeis4.)