|
Search: id:A098949
|
|
|
| A098949 |
|
Slowest increasing sequence where [9] is the only odd digit in each integer. |
|
+0
1
|
|
| 9, 29, 49, 69, 89, 90, 92, 94, 96, 98, 99, 209, 229, 249, 269, 289, 290, 292, 294, 296, 298, 299, 409, 429, 449, 469, 489, 490, 492, 494, 496, 498, 499, 609, 629, 649, 669, 689, 690, 692, 694, 696, 698, 699, 809, 829, 849, 869, 889, 890, 892, 894, 896, 898
(list; graph; listen)
|
|
|
OFFSET
|
9,1
|
|
|
COMMENT
|
The number of terms of this sequence which are smaller than 10^n is n*5^(n-1). - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Jun 06 2006
|
|
MATHEMATICA
|
Select[Range[1000], DigitCount[ # ][[1]] == 0 && DigitCount[ # ][[3]] == 0 && DigitCount[ # ][[5]] == 0 && DigitCount[ # ][[7]] == 0 && DigitCount[ # ][[9]] == 1 &] - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Jun 06 2006
|
|
CROSSREFS
|
Sequence in context: A044976 A002642 A032700 this_sequence A031296 A146869 A129397
Adjacent sequences: A098946 A098947 A098948 this_sequence A098950 A098951 A098952
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
Eric Angelini (eric.angelini(AT)kntv.be), Oct 21 2004
|
|
EXTENSIONS
|
More terms from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Jun 06 2006
|
|
|
Search completed in 0.002 seconds
|
