Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A125910
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A125910 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 and at least one of digits 5,6,7,8,9. +0
10
9, 81, 723, 6381, 55539, 475461, 3993243, 32857101, 264890019, 2094889941, 16282118763, 124625344221, 941303216499, 7029057066021, 51980086628283, 381227207181741, 2776407821318979, 20100192515299701, 144786930345697803 (list; graph; listen)
OFFSET

1,1

LINKS

Milan Janjic, Enumerative Formulas for Some Functions on Finite Sets

FORMULA

a(n)=15*7^n-45*6^n+65*5^n-55*4^n+28*3^n-8*2^n+1.

EXAMPLE

a(8)=32857101

MAPLE

f:=n->15*7^n-45*6^n+65*5^n-55*4^n+28*3^n-8*2^n+1;

CROSSREFS

Cf. A125630.

Sequence in context: A063824 A167717 A073531 this_sequence A125947 A120997 A125630

Adjacent sequences: A125907 A125908 A125909 this_sequence A125911 A125912 A125913

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 November 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research