Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A132187
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A132187 a(n) pertains to numbers x such that, for any m, the number formed from the first m digits of x is congruent to n mod m; but no digit can be appended to maintain the condition. a(n) is the quantity of such numbers. +0
3
294, 268, 284, 260, 264, 281, 261, 286, 267, 244, 292, 265, 286, 300, 260, 293, 297, 281, 274, 262, 240, 259, 277, 296, 306, 266, 280, 259, 263, 284, 265, 293, 287, 259, 287, 273, 270, 298, 245, 257, 286, 257, 292, 272, 264, 286, 287, 310, 294, 268, 257 (list; graph; listen)
OFFSET

0,1

COMMENT

The smallest number for each n is A134595, the largest is A132185.

CROSSREFS

Cf. A051883, A132185, A134595.

Sequence in context: A085502 A108828 A145206 this_sequence A128965 A063049 A131274

Adjacent sequences: A132184 A132185 A132186 this_sequence A132188 A132189 A132190

KEYWORD

nonn,base,easy

AUTHOR

Philippe LALLOUET (philip.lallouet(AT)orange.fr), Nov 04 2007

EXTENSIONS

Edited by Don Reble (djr(AT)nk.ca), Nov 07 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