[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A356123
Least Lucas number with n Lucas divisors.
3
1, 2, 4, 18, 1364, 1860498, 2537720636, 6440026026380244498, 8784200221406821330636, 77162173529763648886126034136172445632164498, 4365101043708483494615466932242949707161871659736799144058331102381689400753867700636
OFFSET
1,2
LINKS
FORMULA
a(n) = A000032(A356666(n)). - Daniel Suteu, Aug 24 2022
PROG
(PARI) L(n)=fibonacci(n+1)+fibonacci(n-1); \\ A000032
isld(n) = { my(u1=1, u2=3, old_u1); if(n<=2, sign(n), while(n>u2, old_u1=u1; u1=u2; u2=old_u1+u2); (u2==n)); }; \\ A102460
nbld(n) = sumdiv(n, d, isld(d)); \\ A304092
a(n) = my(k=0); while(nbld(L(k)) != n, k++); L(k);
(PARI)
countLd(n) = my(c=0, x=2, y=1); while(x <= n, if(n%x == 0, c++); [x, y]=[y, x+y]); c;
a(n) = if(n==1, return(1)); my(x=2, y=1); while(1, if(countLd(x) == n, return(x)); [x, y]=[y, x+y]); \\ Daniel Suteu, Aug 24 2022
CROSSREFS
Cf. A076985 (similar for Fibonacci numbers).
Sequence in context: A323702 A318531 A009667 * A009508 A275000 A290595
KEYWORD
nonn
AUTHOR
Michel Marcus, Jul 27 2022
EXTENSIONS
a(11) from Daniel Suteu, Aug 06 2022
STATUS
approved