Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A063478
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A063478 Sum_{d|F(n)} d^2, where F(n) are the Fibonacci numbers. +0
1
1, 1, 5, 10, 26, 85, 170, 500, 1450, 3172, 7922, 31031, 54290, 143140, 483860, 1105000, 2550410, 8923300, 17494900, 53353040, 150655700, 313727044, 821223650, 3291697500, 5862907302, 14736586180, 48413209000, 113026206800 (list; graph; listen)
OFFSET

1,3

LINKS

Harry J. Smith, Table of n, a(n) for n=1,...,200

PROGRAM

(PARI) j=[]; for(n=1, 40, j=concat(j, sumdiv(fibonacci(n), d, d^2))); j

(Other) sage: [sigma(fibonacci(n), 2)for n in xrange(1, 29)] # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jun 04 2009]

(PARI) { allocatemem(20000000); h=1; g=f=0; for (n=1, 200, f+=h; h=g; g=f; write("b063478.txt", n, " ", sumdiv(f, d, d^2)) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Aug 23 2009]

CROSSREFS

Cf. A000045.

Sequence in context: A083010 A166388 A066872 this_sequence A025486 A128665 A054298

Adjacent sequences: A063475 A063476 A063477 this_sequence A063479 A063480 A063481

KEYWORD

easy,nonn

AUTHOR

Jason Earls (zevi_35711(AT)yahoo.com), Jul 28 2001

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research