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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A126641 a(n) is the number of integers k less than 10^n such that the decimal representation of k lacks the digit 1, at least one of digits 2,3, at least one of digits 4,5, at least one of digits 6,7 and at least one of digits 8,9. 1
9, 73, 537, 3625, 22809, 135913, 777177, 4308265, 23329689, 124104553, 651267417, 3382100905, 17421964569, 89180975593, 454265623257, 2304999893545, 11660373751449, 58845428989033, 296407578308697, 1490778208598185 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

LINKS

Milan Janjic, Enumerative Formulas for Some Functions on Finite Sets

FORMULA

a(n)=16*5^n-32*4^n+24*3^n-8*2^n+1

EXAMPLE

a(8)=4308265

MAPLE

f:=n->16*5^n-32*4^n+24*3^n-8*2^n+1;

CROSSREFS

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

Sequence in context: A096129 A143571 A079927 * A081627 A164588 A023001

Adjacent sequences:  A126638 A126639 A126640 * A126642 A126643 A126644

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 15 20:03 EST 2012. Contains 205852 sequences.