login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A126629 a(n) is the number of nonnegative integers k less than 10^n such that the decimal representation of k lacks digits 1 and 2, at least one of digits 3,4,5 and at least one of digits 6,7,8,9. 0
8, 64, 506, 3916, 29498, 215524, 1527506, 10528876, 70841738, 467044084, 3027621506, 19356463036, 122355512378, 766290978244, 4762898595506, 29420807536396, 180813134269418, 1106606890266004, 6749433735297506 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

LINKS

Milan Janjic, Enumerative Formulas for Some Functions on Finite Sets

FORMULA

a(n)=12*6^n-30*5^n+34*4^n-21*3^n+7*2^n-1

EXAMPLE

a(8)=10528876

MAPLE

f:=n->12*6^n-30*5^n+34*4^n-21*3^n+7*2^n-1;

CROSSREFS

Cf. A125630, A125948, A125947, A125946, A125945, A125910, A125909, A125908, A125880, A125897, A125904, A125858.

Sequence in context: A146885 A122093 A127426 * A171282 A125498 A193539

Adjacent sequences:  A126626 A126627 A126628 * A126630 A126631 A126632

KEYWORD

nonn,base

AUTHOR

Aleksandar M. Janjic and Milan R. Janjic (agnus(AT)blic.net), Feb 08 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 22:15 EST 2012. Contains 205670 sequences.