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!)
A083261 a(n) = gcd(A046523(n+1), A046523(n)). 3
1, 2, 2, 2, 2, 2, 2, 4, 2, 2, 2, 2, 2, 6, 2, 2, 2, 2, 2, 6, 6, 2, 2, 4, 2, 2, 4, 2, 2, 2, 2, 2, 6, 6, 6, 2, 2, 6, 6, 2, 2, 2, 2, 12, 6, 2, 2, 4, 4, 6, 6, 2, 2, 6, 6, 6, 6, 2, 2, 2, 2, 6, 4, 2, 6, 2, 2, 6, 6, 2, 2, 2, 2, 6, 12, 6, 6, 2, 2, 16, 2, 2, 2, 6, 6, 6, 6, 2, 2, 6, 6, 6, 6, 6, 6, 2, 2, 12, 12, 2, 2, 2, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
PROG
(PARI)
A046523(n) = { my(f=vecsort(factor(n)[, 2], , 4), p); prod(i=1, #f, (p=nextprime(p+1))^f[i]); }; \\ This function from Charles R Greathouse IV, Aug 17 2011
A083261(n) = gcd(A046523(n), A046523(1+n)); \\ From Antti Karttunen, May 21 2017
CROSSREFS
Sequence in context: A331566 A358473 A369978 * A003648 A003642 A100007
KEYWORD
nonn
AUTHOR
Labos Elemer, May 09 2003
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 23 20:33 EDT 2024. Contains 371916 sequences. (Running on oeis4.)