|
| |
|
|
A160680
|
|
a0)=1, a(1)=1, f(i) fibonacci numbers,f(0)=1,f(1)=1. a(n)= sigma_0(f(n-1))+sigma_0(f(n-2)) also a(n)=A000005(A000045(n-1))+ A000005(A000045(n-2)).
|
|
0
| |
|
|
1, 1, 2, 3, 4, 4, 6, 6, 6, 8, 8, 6, 17, 17, 6, 12, 16, 10, 18, 20, 20, 24, 12, 6, 74, 78, 10, 20, 32, 18, 66, 68, 20, 24, 12, 12, 168, 168, 16, 16, 72, 68, 68, 66, 34, 64, 40, 10, 338, 344, 56, 56, 24, 20, 132, 144, 112, 128, 40, 12, 964, 964, 12, 40, 96, 72, 72, 72, 40, 64, 160
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,3
|
|
|
FORMULA
| a(n)=A063375(n-1)+A063375(n-2), n>2. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 25 2009, Jun 01 2009]
|
|
|
MAPLE
| A063375 := proc(n) A000005(A000045(n)) ; end: A000045 := proc(n) combinat[fibonacci](n) ; end: A000005 := proc(n) numtheory[tau](n) ; end: printf("1, 1, ", n) ; for n from 3 to 120 do printf("%d, ", A063375(n-1)+A063375(n-2)) ; od: [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 25 2009]
|
|
|
CROSSREFS
| Cf. A000005, A000045
Sequence in context: A096908 A162684 A145340 * A061984 A063208 A092988
Adjacent sequences: A160677 A160678 A160679 * A160681 A160682 A160683
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Ctibor O. Zizka (c.zizka(AT)email.cz), May 23 2009
|
|
|
EXTENSIONS
| More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 25 2009
|
| |
|
|
