Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A064605
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A064605 Partial sum of Sigma_2(n) is divisible by n, where Sigma_2(n)=A001157(n). +0
7
1, 2, 8, 74, 146, 150, 158, 307, 526, 541, 16157, 20289, 271343, 953614 (list; graph; listen)
OFFSET

1,2

COMMENT

Analogous sequences for various arithmetical functions are A050226, A056650, A064605-A064607, A064610, A064611, A048290, A062982, A045345.

FORMULA

Mod[Sum{sigma_2(j), j=1..n}, n]=Mod[A064602(n), n]=0

EXAMPLE

Summarizing divisor-square sums for j=1,...,8 gives 1+5+10+21+26+50+50+85=248, which is divisible by n=8, so 8 is here and the integer quotient is 31.

CROSSREFS

A001157, A064602 A050226, A056650, A064605-A064607, A064610-A064612, A048290, A062982, A045345.

Sequence in context: A013002 A012998 A143760 this_sequence A132039 A002668 A093062

Adjacent sequences: A064602 A064603 A064604 this_sequence A064606 A064607 A064608

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Sep 24 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 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research