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!)
A340083 a(n) = (n-1) / gcd(n-1, A003958(n)). 5
0, 1, 1, 3, 1, 5, 1, 7, 2, 9, 1, 11, 1, 13, 7, 15, 1, 17, 1, 19, 5, 21, 1, 23, 3, 25, 13, 9, 1, 29, 1, 31, 8, 33, 17, 35, 1, 37, 19, 39, 1, 41, 1, 43, 11, 45, 1, 47, 4, 49, 25, 17, 1, 53, 27, 55, 14, 57, 1, 59, 1, 61, 31, 63, 4, 13, 1, 67, 17, 23, 1, 71, 1, 73, 37, 25, 19, 77, 1, 79, 5, 81, 1, 83, 21, 85, 43, 87, 1, 89, 5, 91, 23 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
LINKS
FORMULA
a(n) = (n-1) / A340081(n) = (n-1) / gcd(n-1, A003958(n)).
PROG
(PARI)
A003958(n) = if(1==n, n, my(f=factor(n)); for(i=1, #f~, f[i, 1]--); factorback(f));
A340083(n) = ((n-1)/gcd(n-1, A003958(n)));
CROSSREFS
Cf. also A160596, A340073.
Sequence in context: A093411 A147088 A346468 * A339667 A322993 A118402
KEYWORD
nonn
AUTHOR
Antti Karttunen, Dec 28 2020
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 11:21 EDT 2024. Contains 371936 sequences. (Running on oeis4.)