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!)
A323072 a(n) = n/A323071(n) = n/gcd(n, 1+A060681(n)). 5
1, 1, 1, 4, 1, 3, 1, 8, 9, 5, 1, 12, 1, 7, 15, 16, 1, 9, 1, 20, 7, 11, 1, 24, 25, 13, 27, 28, 1, 15, 1, 32, 33, 17, 35, 36, 1, 19, 13, 40, 1, 21, 1, 44, 45, 23, 1, 48, 49, 25, 51, 52, 1, 27, 11, 56, 19, 29, 1, 60, 1, 31, 63, 64, 65, 33, 1, 68, 69, 35, 1, 72, 1, 37, 25, 76, 77, 39, 1, 80, 81, 41, 1, 84, 85, 43, 87, 88, 1, 45, 91, 92, 31, 47 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
COMMENTS
Differs from A055032 at n = 55, 105, 155, ..., (A323070).
LINKS
FORMULA
a(n) = n/A323071(n) = n/gcd(n, 1+A060681(n)).
PROG
(PARI)
A060681(n) = (n-if(1==n, n, n/vecmin(factor(n)[, 1])));
A323071(n) = gcd(n, 1+A060681(n));
A323072(n) = (n/A323071(n));
CROSSREFS
Sequence in context: A326690 A353275 A340079 * A055032 A039930 A123251
KEYWORD
nonn
AUTHOR
Antti Karttunen, Jan 04 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 07:11 EDT 2024. Contains 371782 sequences. (Running on oeis4.)