cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A290936 a(n) is the least k such that sigma(k) is a Fibonacci number when k is the product of n distinct primes, or 0 if no such k exists.

This page as a plain text file.
%I A290936 #34 Nov 23 2019 08:09:59
%S A290936 2,94,66,19290,2000006490,247917529768610,
%T A290936 276320525457530886869600795810
%N A290936 a(n) is the least k such that sigma(k) is a Fibonacci number when k is the product of n distinct primes, or 0 if no such k exists.
%e A290936 a(4) = 19290 since 19290 = 2*3*5*643, sigma(19290) = 3*4*6*644 = 46368 = Fibonacci(24) and 19290 is the least number with this property.
%e A290936 a(5) = 2000006490 since 2000006490 = 2*3*5*643*103681, sigma(2000006490) = 3*4*6*644*103682 = 4807526976 = Fibonacci(48) and 2000006490 is the least number with this property.
%o A290936 (PARI) isFibonacci(n)=my(k=n^2); issquare(k+=(k+1)<<2) || (n>0 && issquare(k-8));
%o A290936 a(n) = {my(k = 1); while (!issquarefree(k) || bigomega(k) != n || !isFibonacci(sigma(k)), k++); k;} \\ after _Charles R Greathouse IV_ at A272412
%Y A290936 Cf. A000045, A000203, A272412.
%K A290936 nonn,hard,more
%O A290936 1,1
%A A290936 _Altug Alkan_, Aug 14 2017
%E A290936 a(5)-a(6) confirmed by _Giovanni Resta_, Aug 16 2017
%E A290936 a(7) from _Daniel Suteu_, Nov 23 2019