Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A114135
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A114135 Primitive numbers n such that the sums of the digits of n, n^2 and n^3 coincide (cf. A111434). +0
2
1, 468, 585, 5851, 5868, 28845, 58968, 21688965, 29588877, 37848897, 49879981, 58577797, 79898994, 79958368, 79979698, 89757468, 109699677, 159699969, 468957888, 479597652, 479896587, 480749985, 494899398, 497349981, 498678256 (list; graph; listen)
OFFSET

1,2

COMMENT

Members of A111434 not congruent to 0 (mod 10). If k is a member of A111434 then so is 10^e*k.

The authors have calculated all members below 10^11.

The number of members less than 10^n {n=0..11}: 0,1,1,3,5,7,7,7,16,34,57,125.

Number of members congruent to k (mod 10): 0,7,1,0,2,23,8,20,49,15. But more interesting, number of members are congruent to k (mod 9): 66,59,0,0,0,0,0,0,0.

MATHEMATICA

sod[n_] := Plus @@ IntegerDigits@n; lst = {}; Do[ If[(Mod[n, 9] == 0 || Mod[n, 9] == 1) && Mod[n, 10] != 0 && sod@n == sod[n2] == sod[n3], AppendTo[lst, n]], {n, 108/2}]; lst

CROSSREFS

Cf. A111434, A005188.

Sequence in context: A036339 A036340 A059395 this_sequence A043364 A054756 A045305

Adjacent sequences: A114132 A114133 A114134 this_sequence A114136 A114137 A114138

KEYWORD

base,nonn

AUTHOR

Giovanni Resta (g.resta(AT)iit.cnr.it) and Robert G. Wilson v (rgwv(AT)rgwv.com), Nov 21 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 25 13:47 EST 2009. Contains 167481 sequences.


AT&T Labs Research