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!)
A369529 a(n) = gcd(A007953(n), A007954(n)). 0
1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 4, 1, 2, 1, 4, 1, 2, 1, 3, 1, 1, 3, 1, 1, 9, 1, 1, 3, 4, 1, 2, 1, 8, 1, 2, 1, 4, 1, 5, 1, 1, 1, 1, 5, 1, 1, 1, 1, 6, 1, 4, 9, 2, 1, 12, 1, 2, 3, 7, 1, 1, 1, 1, 1, 1, 7, 1, 1, 8, 1, 2, 1, 4, 1, 2, 1, 16, 1, 9, 1, 1, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
EXAMPLE
a(15) = gcd(A007953(15), A007954(15)) = gcd(6,5) = 1.
MATHEMATICA
a[n_] := GCD @@ Apply[{Plus @@ #, Times @@ #} &, {IntegerDigits[n]}]; Array[a, 100] (* Amiram Eldar, Jan 26 2024 *)
CROSSREFS
Sequence in context: A052423 A126616 A121042 * A000030 A179635 A306354
KEYWORD
nonn,base,easy
AUTHOR
Ctibor O. Zizka, Jan 25 2024
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 September 15 14:33 EDT 2024. Contains 375938 sequences. (Running on oeis4.)