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!)
A164912 Dual EKG: a(n) = A008619(A064413(n) - 1). 2

%I #31 Nov 24 2021 03:04:58

%S 1,1,2,3,2,5,6,4,5,3,8,9,7,4,11,12,8,10,11,6,17,14,15,13,18,14,13,7,

%T 20,18,16,17,9,26,21,19,10,29,23,20,22,23,12,35,24,25,26,27,28,25,32,

%U 30,28,33,35,29,15,44,33,31,16,47,36,32,34,37,19,56

%N Dual EKG: a(n) = A008619(A064413(n) - 1).

%C First occurrences of n have ranks: 1, 3, 4, 8, 6, 7, 13, 11, 12, 18, ...

%C Second occurrences of n have ranks: 2, 5, 10, 14, 9, 20, ...

%C Triples of the form (a, b, a+b): (1,1,2), (3,2,5), (5,3,8), (7,4,11), (11,6,17), ... give sequence 2, 5, 8, 11, 17, ....

%C Every positive integer appears exactly twice. - _Charlie Neder_, Jan 12 2019

%H Michael De Vlieger, <a href="/A164912/b164912.txt">Table of n, a(n) for n = 1..10000</a>

%F a(n) = A008619(A064413(n)-1) = ceiling(A064413(n)/2). - _Charlie Neder_, Jan 12 2019

%t ekg[n_] := ekg[n] = Module[{ee, k},

%t If[n <= 2, n, ee = Array[ekg, n - 1];

%t For[k = 1, True, k++, If[FreeQ[ee, k] &&

%t GCD[ekg[n - 1], k] != 1, Return[k]]]]];

%t a[n_] := Quotient[ekg[n] - 1, 2] + 1;

%t Array[a, 68] (* _Jean-François Alcover_, Nov 21 2021 *)

%Y Cf. A000027, A008619, A064413.

%K nonn

%O 1,3

%A _Paul Curtz_, Aug 31 2009

%E More terms from _Charlie Neder_, Jan 12 2019

%E Name modified by _Jean-François Alcover_, Nov 23 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 April 23 20:33 EDT 2024. Contains 371916 sequences. (Running on oeis4.)