Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A125947
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A125947 a(n) is the number of nonnegative integers k less than 10^n such that the decimal representation of k lacks the digit 1, at least one of digits 2,3,4,5 and at least one of digits 6,7,8,9. +0
18
9, 81, 729, 6513, 57369, 495921, 4194969, 34689393, 280607769, 2224214961, 17313344409, 132651929073, 1002605145369, 7490229758001, 55407572177049, 406450276733553, 2960529995462169, 21435301615525041, 154414691892116889 (list; graph; listen)
OFFSET

1,1

LINKS

Milan Janjic, Enumerative Formulas for Some Functions on Finite Sets

FORMULA

a(n)=16*7^n-48*6^n+68*5^n-56*4^n+28*3^n-8*2^n+1.

EXAMPLE

a(8)=34689393

MAPLE

f:=n->16*7^n-48*6^n+68*5^n-56*4^n+28*3^n-8*2^n+1;

CROSSREFS

Cf. A125630.

Adjacent sequences: A125944 A125945 A125946 this_sequence A125948 A125949 A125950

Sequence in context: A063824 A073531 A125910 this_sequence A120997 A125630 A100062

KEYWORD

nonn,base

AUTHOR

Aleksandar M. Janjic and Milan R. Janjic, (agnus(AT)blic.net), Feb 04 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 October 7 14:39 EDT 2008. Contains 144666 sequences.


AT&T Labs Research