Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A117810
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A117810 Numbers n such that n is k*(the sum of decimal digits squared of n), k=153 case. +0
1
0, 4131, 12546, 14382, 16218, 16830, 26469 (list; graph; listen)
OFFSET

1,2

COMMENT

k=153 case has the longest sequence for k <= 1000.

MATHEMATICA

k=153; Do[If[n==k*Total[IntegerDigits[n]^2], Print[n]], {n, 0, 200000, k}]

CROSSREFS

Cf. A117565 k=7 case.

Sequence in context: A045032 A125502 A015937 this_sequence A107541 A106537 A072896

Adjacent sequences: A117807 A117808 A117809 this_sequence A117811 A117812 A117813

KEYWORD

base,fini,full,nonn

AUTHOR

Zak Seidov (zakseidov(AT)yahoo.com), Apr 30 2006

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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research