|
Search: id:A063375
|
|
|
| A063375 |
|
Number of divisors of Fibonacci(n). |
|
+0
13
|
|
| 1, 1, 2, 2, 2, 4, 2, 4, 4, 4, 2, 15, 2, 4, 8, 8, 2, 16, 4, 16, 8, 4, 2, 72, 6, 4, 16, 16, 2, 64, 4, 16, 8, 4, 8, 160, 8, 8, 8, 64, 4, 64, 2, 32, 32, 8, 2, 336, 8, 48, 8, 16, 4, 128, 16, 96, 32, 8, 4, 960, 4, 8, 32, 64, 8, 64, 8, 32, 32, 128, 4, 1536, 4, 16, 48, 32, 16, 128, 4, 512, 128, 8
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=1,...,466
|
|
FORMULA
|
a(n) = A000005(A000045(n)). [From Omar E. Pol (info(AT)polprimos.com), Dec 20 2008]
|
|
PROGRAM
|
(PARI) j=[]; for(n=1, 150, j=concat(j, numdiv(fibonacci(n)))); j
(PARI) { for (n = 1, 466, write("b063375.txt", n, " ", numdiv(fibonacci(n))) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Aug 20 2009]
|
|
CROSSREFS
|
Cf. A000005, A000045. [From Omar E. Pol (info(AT)polprimos.com), Dec 20 2008]
Sequence in context: A152674 A072056 A066012 this_sequence A064129 A005137 A105681
Adjacent sequences: A063372 A063373 A063374 this_sequence A063376 A063377 A063378
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Jason Earls (zevi_35711(AT)yahoo.com), Jul 23 2001
|
|
|
Search completed in 0.002 seconds
|
