Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A131639
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A131639 Numbers n such that the sum of all numbers formed by deleting one digit from n is equal to n. +0
1
1729404, 1800000, 13758846, 13800000, 14358846, 14400000, 15000000, 28758846, 28800000, 29358846, 29400000 (list; graph; listen)
OFFSET

1,1

FORMULA

For a number with n digits there are n substrings generated by removing one digit from the original number. So for 12345, these are 2345, 1345, 1245, 1235, 1234. Sum(x) is defined as the sum of this substrings for a number x, and the sequence above is those numbers so that sum(x) = x.

EXAMPLE

First term is 1729404 because sum(1729404) = 729404 + 129404 + 179404 + 172404 + 172904 + 172944 + 172940 = 1729404

CROSSREFS

Cf. A093882.

Sequence in context: A083600 A121887 A083646 this_sequence A124068 A090054 A095391

Adjacent sequences: A131636 A131637 A131638 this_sequence A131640 A131641 A131642

KEYWORD

base,easy,nonn

AUTHOR

Jon Ayres (jonathan.ayres(AT)ntlworld), Sep 05 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 December 3 01:16 EST 2008. Contains 151161 sequences.


AT&T Labs Research