Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A062933
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A062933 Numbers n such that n divides the sum of digits of 8^n. +0
1
1, 2, 25, 70, 106, 268, 304, 358, 1559, 2369, 2824, 2855, 3616, 5218 (list; graph; listen)
OFFSET

1,2

COMMENT

The next term, if it exists, is greater than 100000. - Ryan Propper (rpropper(AT)stanford.edu), Aug 31 2005

EXAMPLE

a(2)=25, so 25 divides sum of digits of 8^25 (i.e.3+7+7+7+8+9+3+1+8+6+2+9+5+7+1+6+1+7+0+9+5+6+8=125).

MATHEMATICA

k = 1; Do[k *= 8; s = Plus @@ IntegerDigits[k]; If[Mod[s, n] == 0, Print[n]], {n, 1, 10^5}] (Propper)

CROSSREFS

Sequence in context: A038834 A041071 A153478 this_sequence A123012 A080515 A009381

Adjacent sequences: A062930 A062931 A062932 this_sequence A062934 A062935 A062936

KEYWORD

hard,nonn,base

AUTHOR

Shyam Sunder Gupta (guptass(AT)rediffmail.com ) and Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Feb 16 2002

EXTENSIONS

Corrected and extended by Ryan Propper (rpropper(AT)stanford.edu), Aug 31 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