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!)
A168007 Jumping divisor sequence (see Comments lines for definition). 3

%I #46 Mar 15 2023 04:13:43

%S 1,2,4,3,6,5,10,9,12,11,22,21,24,23,46,45,48,47,94,93,96,95,100,99,

%T 102,101,202,201,204,203,210,209,220,219,222,221,234,233,466,465,468,

%U 467,934,933,936,935,940,939,942,941,1882,1881,1884,1883,1890,1889,3778,3777,3780,3779,7558,7557,7560,7559

%N Jumping divisor sequence (see Comments lines for definition).

%C Consider the diagram with overlapping periodic curves that appears in the Links section (figure 2). The number of curves that contain the point [n,0] equals the number of divisors of n. The curve of diameter d represents the divisor d of n. Now consider only the lower part of the diagram (figure 3). Starting from point [1,0] we continue our journey walking along the semicircumference with smallest diameter not used previously (see the illustration of initial terms, figure 1). The sequence is formed by the values of n where the trajectory intercepts the x axis. - _Omar E. Pol_, Jan 14 2019

%H Jinyuan Wang, <a href="/A168007/b168007.txt">Table of n, a(n) for n = 1..1000</a>

%H Omar E. Pol, <a href="http://www.polprimos.com/imagenespub/poldiv09.jpg">Illustration of initial terms (Fig. 1)</a>

%H Omar E. Pol, <a href="http://www.polprimos.com/imagenespub/poldiv01.jpg">Periodic curves and tau(n) (Fig. 2)</a>

%H Omar E. Pol, <a href="http://www.polprimos.com/imagenespub/poldiv03.jpg">Periodic curves and tau(n), lower part upside down (Fig. 3)</a>

%F a(1) = 1; if a(n) is an even composite number then a(n+1) = a(n) - 1; otherwise a(n+1) = a(n) + A020639(a(n)). - _Omar E. Pol_, Jan 13 2019

%o (PARI) lista(nn) = {my(v=vector(nn, i, if(i<4, 2^i/2))); for(n=4, nn, if(v[n-1]%2, v[n]=v[n-1] + factor(v[n-1])[1, 1], v[n]=v[n-1] - 1)); v; } \\ _Jinyuan Wang_, Mar 14 2020

%o (Python)

%o from itertools import count, islice

%o from sympy import primefactors

%o def A168007_gen(): # generator of terms

%o yield (a := 1)

%o for n in count(2):

%o yield (a:=a+(min(primefactors(a),default=1) if a&1 or a==2 else -1))

%o A168007_list = list(islice(A168007_gen(),20)) # _Chai Wah Wu_, Mar 14 2023

%Y Cf. A000005, A002808, A020639, A004280, A168008, A168009.

%K nonn,easy

%O 1,2

%A _Omar E. Pol_, Nov 19 2009

%E More terms from _Omar E. Pol_, Jan 12 2019

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 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)