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!)
A343902 T(n, k) is the k-th prime p such that (p-1)|A000010(n); irregular array read by rows. 2
2, 2, 2, 3, 2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 5, 7, 2, 3, 2, 3, 5, 2, 3, 5, 2, 3, 5, 2, 3, 2, 3, 7, 2, 3, 5, 2, 3, 5, 7, 2, 3, 2, 3, 2, 3, 5, 2, 3, 5, 11, 2, 3, 5, 7, 2, 3, 7, 2, 3, 5, 7, 2, 3, 5, 2, 3, 5, 2, 3, 7, 11, 2, 3, 5, 2, 3, 5, 11, 2, 3, 5 (list; graph; refs; listen; history; text; internal format)
OFFSET
3,1
LINKS
EXAMPLE
The irregular array T starts as follows:
2
2
2, 3
2
2, 3
2, 3
2, 3
2, 3
2, 3
2, 3
2, 3, 5, 7
2, 3
2, 3, 5
2, 3, 5
2, 3, 5
2, 3
2, 3, 7
2, 3, 5
2, 3, 5, 7
2, 3
2, 3
2, 3, 5
2, 3, 5, 11
2, 3, 5, 7
2, 3, 7
2, 3, 5, 7
2, 3, 5
2, 3, 5
2, 3, 7, 11
2, 3, 5
PROG
(PARI) row(n) = my(e=eulerphi(n)); forprime(p=2, e, if(e%(p-1)==0, print1(p, ", "))); print("")
array(rows) = for(x=3, rows+2, row(x))
array(10) \\ Print upper 10 rows of the array
CROSSREFS
Sequence in context: A085694 A258570 A257572 * A160493 A053760 A223942
KEYWORD
nonn,tabf
AUTHOR
Felix Fröhlich, May 03 2021
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 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)