Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A075761
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A075761 Numbers n such that there are at least 3 integers k from the set {2,3,4,5,6,7,8,9} such that the digital sum of each base k representation of n equals k. +0
1
13, 17, 19, 21, 25, 29, 31, 33, 37, 41, 57, 61, 65, 73, 85, 91, 121, 129, 133, 145, 169, 225, 253, 257, 261, 265, 281, 301, 325, 337, 361, 385, 505, 513, 757, 785, 841, 1057, 1081, 1093, 1381, 1625, 2080, 2241, 3241, 4117, 4377, 4401, 5125, 8281, 16416 (list; graph; listen)
page 1

Search completed in 0.001 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 17 19:39 EST 2009. Contains 170821 sequences.


AT&T Labs Research