Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A130680
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A130680 Numbers n such that n = (a_1 + a_2 + ... + a_p)*(a_1^3 + a_2^3 + ... + a_p^3), where n has the decimal expansion a_1a_2...a_p. +0
1
1, 1215, 3700, 11680, 13608, 87949 (list; graph; listen)
OFFSET

1,2

COMMENT

This sequence is finite and all the terms are listed. Proof. Let a_1a_2...a_p be the decimal expansion of n. Then p <= log_10(n)+1. Furthermore we have a_i <= 9, therefore (a_1 + a_2 + ... + a_p) <= 9*(log_10(n)+1) and (a_1^3 + a_2^3 + ... + a_p^3) <= 9^3*(log_10(n)+1). On the other hand, for all n > 300000 we have 9^4*(log_10(n)+1)^2 < n. A computer search confirms that we indeed have found all terms.

EXAMPLE

87949=(8+7+9+4+9)*(8^3+7^3+9^3+4^3+9^3)

MATHEMATICA

For[n = 1, n < 1000000, n++, b = IntegerDigits[n]; If[Sum[b[[i]], {i, 1, Length[b]}] * Sum[b[[i]]^3, {i, 1, Length[b]}] == n, Print[n]]]

CROSSREFS

Cf. A115518.

Sequence in context: A047627 A047626 A105311 this_sequence A068783 A059287 A059669

Adjacent sequences: A130677 A130678 A130679 this_sequence A130681 A130682 A130683

KEYWORD

base,fini,full,nonn

AUTHOR

Aktar Yalcin (aktaryalcin(AT)msn.com), Jun 29 2007

EXTENSIONS

Edited by Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Jul 13 2007

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