|
| |
|
|
A130451
|
|
Number of divisors of A123193(n).
|
|
2
| |
|
|
1, 2, 2, 3, 2, 2, 3, 2, 2, 5, 2, 2, 2, 8, 3, 2, 8, 2, 2, 8, 2, 8, 2, 2, 3, 2, 8, 8, 2, 2, 8, 2, 8, 2, 2, 8, 2, 5, 2, 8, 2, 2, 2, 8, 2, 8, 8, 2, 2, 8, 2, 8, 3, 2, 8, 8, 2, 8, 8, 2, 8, 2, 2, 2, 8, 8, 2, 2, 8, 2, 3, 8, 2, 8, 2, 2, 8, 8, 8, 8
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
FORMULA
| a(n)=A000005(A123193(n)). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Nov 16 2007
|
|
|
MAPLE
| isFib := proc(n) local i ; for i from 1 do if combinat[fibonacci](i) > n then RETURN(false) ; elif combinat[fibonacci](i) = n then RETURN(true) ; fi ; od: end: A123193 := proc(n) option remember ; local nmin, k ; nmin := 1 : if n > 1 then nmin := A123193(n-1)+1 ; fi ; for k from nmin do if isFib( numtheory[tau](k) ) then RETURN(k) ; fi ; od: end: A130451 := proc(n) numtheory[tau](A123193(n)) ; end: seq(A130451(n), n=1..80) ; - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Nov 16 2007
|
|
|
CROSSREFS
| Sequence in context: A087159 A062502 A141242 * A130285 A046027 A046028
Adjacent sequences: A130448 A130449 A130450 * A130452 A130453 A130454
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Giovanni Teofilatto (g.teofilatto(AT)tiscalinet.it), Aug 08 2007
|
|
|
EXTENSIONS
| Corrected and extended by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Nov 16 2007
|
| |
|
|
