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!)
A339790 First coefficient of the lindep transform of sigma(n). 3
1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 3, 1, 2, 1, 2, 2, 1, 1, 2, 1, 1, 2, 2, 3, 2, 1, 2, 2, 4, 1, 3, 1, 1, 4, 2, 1, 2, 1, 1, 5, 1, 1, 4, 3, 1, 5, 2, 1, 1, 1, 2, 3, 1, 3, 1, 1, 1, 5, 1, 1, 3, 1, 2, 3, 1, 4, 1, 1, 3, 2, 2, 1, 3, 4, 2, 5, 1, 1, 5, 4, 6, 3, 2, 4, 3, 1, 4, 7, 6 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,9
COMMENTS
If {b(n)} is a sequence of integers, we will call the "lindep transform" of {b(n)} the triplet of sequences ({x(n)}, {y(n)}, {z(n)}) such that:
(i) x(n) >= 1
(ii) x(n) + abs(y(n)) + abs(z(n)) is minimal
(iii) x(n)*b(n) + y(n)*n + z(n) = 0
(iv) if with the conditions (i), (ii), (iii) there exist several triplets (x(n), y(n), z(n)) we then choose the one with minimal y(n).
We call x(n) the first coefficient of the lindep transform of b(n), y(n) the second and z(n) the third. As this corresponds to the lindep function of PARI/GP this transform is called the "lindep transform".
LINKS
FORMULA
Conjecture: a(n) << sqrt(n) with 0 < limsup n->oo a(n)/sqrt(n) < oo exists (see graphic). Trivially liminf a(n)/sqrt(n) = 0 since for prime n we have a(n)=1.
PROG
(PARI) a(n)=(lindep([sigma(n), n, 1])*sign(lindep([sigma(n), n, 1])[1]))[1]
CROSSREFS
Sequence in context: A300826 A334926 A305936 * A334924 A211111 A074971
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Dec 17 2020
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 March 28 05:02 EDT 2024. Contains 371235 sequences. (Running on oeis4.)