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!)
A242276 Irregular array of factors of n-th Poulet number read by rows, where row n corresponds to A001567(n). 1
11, 31, 3, 11, 17, 3, 5, 43, 5, 13, 17, 19, 73, 7, 13, 19, 3, 5, 127, 23, 89, 5, 17, 29, 37, 73, 7, 13, 31, 29, 113, 37, 109, 17, 257, 3, 31, 47, 31, 151, 43, 127, 7, 23, 41, 73, 109, 53, 157, 3, 11, 257, 7, 19, 67, 31, 331, 5, 29, 73, 5, 7, 17, 19, 3, 17, 251, 7, 13, 151, 59, 233, 11, 31, 41, 43, 337, 23, 683, 7, 31, 73, 5, 13 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
Felix Fröhlich, Table of n, a(n) for n = 1..2165 (all terms up to 10^7)
EXAMPLE
The first three Poulet numbers (2-pseudoprimes) are 341 = 11*31, 561 = 3*11*17, and 645 = 3*5*43, so the sequence begins:
11, 31;
3, 11, 17;
3, 5, 43;
etc.
PROG
(PARI) forcomposite(n=1, 1e4, if(Mod(2, n)^(n-1)==1, f=factor(n)[, 1]; for(i=1, #f, print1(f[i], ", "))))
CROSSREFS
Sequence in context: A002755 A346852 A157827 * A196374 A112260 A196114
KEYWORD
nonn,tabf
AUTHOR
Felix Fröhlich, Aug 16 2014
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 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)