Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A109659
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A109659 Numbers n such that the sum of the digits of sigma(n)^n is divisible by n. +0
1
1, 15, 20, 34, 42, 44, 50, 101, 107, 558, 584, 750, 1491, 2793, 2889 (list; graph; listen)
OFFSET

1,2

COMMENT

Next term after 2889, if it exists, is greater than 10000.

EXAMPLE

The digits of sigma(1491)^1491 sum to 22365 and 22365 is divisible by 1491, so 1491 is in the sequence.

MATHEMATICA

Do[s = DivisorSigma[1, n]^n; k = Plus @@ IntegerDigits[s]; If[Mod[k, n] == 0, Print[n]], {n, 1, 10000}]

CROSSREFS

Sequence in context: A086770 A111200 A088494 this_sequence A065148 A093028 A105506

Adjacent sequences: A109656 A109657 A109658 this_sequence A109660 A109661 A109662

KEYWORD

base,more,nonn

AUTHOR

Ryan Propper (rpropper(AT)stanford.edu), Aug 06 2005

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 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research