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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A126628 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 and at least one of digits 5,6,7,8,9. 0
8, 62, 470, 3506, 25718, 184682, 1294910, 8867186, 59423078, 390804602, 2529567950, 16157024066, 102070798838, 639011269322, 3970835898590, 24524390352146, 150705922308998, 922285972770842, 5624983337550830 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

LINKS

Milan Janjic, Enumerative Formulas for Some Functions on Finite Sets

FORMULA

a(n)=10*6^n-25*5^n+30*4^n-20*3^n+7*2^n-1

EXAMPLE

a(8)=8867186

MAPLE

f:=n->10*6^n-25*5^n+30*4^n-20*3^n+7*2^n-1;

CROSSREFS

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

Sequence in context: A056054 A167251 A144143 * A085353 A125396 A163444

Adjacent sequences:  A126625 A126626 A126627 * A126629 A126630 A126631

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 16 01:31 EST 2012. Contains 205860 sequences.