The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A098372 a(n) = Max_{k=1..n-1} gcd(n, A098371(k)). 3

%I #17 Mar 31 2021 20:26:34

%S 1,1,1,2,1,2,1,4,3,2,1,6,1,2,5,4,1,6,1,10,7,2,1,12,5,2,9,7,1,10,1,16,

%T 11,2,7,18,1,2,13,10,1,14,1,22,15,2,1,16,7,10,3,13,1,18,11,28,19,2,1,

%U 30,1,2,21,16,13,22,1,4,23,14,1,36,1,2,15,19,11,26,1,40,27,2,1,42,5,2,29,22

%N a(n) = Max_{k=1..n-1} gcd(n, A098371(k)).

%C From _Antti Karttunen_, Mar 30 2021: (Start)

%C The original definition was: a(n) = Max_{k=1..n} gcd(n, A098371(k)).

%C but this generates terms that differ from ones in the data section at least at n=14, 26, 38, 74, 106.

%C The original author also commented that: A098371(n) = #{k: a(n) = gcd(n, A098371(k))}, but please see my notes in that sequence.

%C (End)

%H Antti Karttunen, <a href="/A098372/b098372.txt">Table of n, a(n) for n = 1..8192</a>

%H Antti Karttunen, <a href="/A098372/a098372.txt">Data supplement: n, a(n) computed for n = 1..65537</a>

%o (PARI) A098372list(up_to) = { my(v=vector(up_to),y=vector(up_to)); v[1] = 1; y[1] = 1; for(n=2,up_to,my(m=1); for(k=1,n-1,m = max(m,gcd(n,v[k]))); y[n] = m; v[n] = sum(k=1,n-1,m == gcd(n,v[k]))); (y); }; \\ _Antti Karttunen_, Mar 30 2021

%Y Cf. A098371.

%K nonn,look

%O 1,4

%A _Reinhard Zumkeller_, Sep 05 2004

%E Definition corrected to match with the data. - _Antti Karttunen_, Mar 30 2021

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 June 12 23:56 EDT 2024. Contains 373362 sequences. (Running on oeis4.)