Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A125630
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A125630 a(n) is the number of integers k less than 10^n such that the decimal representation of k lacks the digit 1 and at least one of digits 2,3,4,5,6,7,8,9. +0
30
9, 81, 729, 6561, 59049, 531441, 4782969, 43006401, 385606089, 3440214801, 30482931609, 267934415841, 2334817386729, 20170171738161, 172797111134649, 1468818073594881, 12396189742824969, 103943773544221521 (list; graph; listen)
OFFSET

1,1

COMMENT

Note that the first seven terms of the sequence are powers of 9.

LINKS

Milan Janjic, Enumerative Formulas for Some Functions on Finite Sets

FORMULA

f(n)=8*8^n-28*7^n+56*6^n-70*5^n+56*4^n-28*3^n+8*2^n-1.

EXAMPLE

f(5)=59049

MAPLE

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

CROSSREFS

Sequence in context: A125910 A125947 A120997 this_sequence A100062 A001019 A074118

Adjacent sequences: A125627 A125628 A125629 this_sequence A125631 A125632 A125633

KEYWORD

nonn

AUTHOR

Aleksandar M. Janjic and Milan R. Janjic (agnus(AT)blic.net), Jan 28 2007, Feb 13 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 July 23 17:35 EDT 2008. Contains 142285 sequences.


AT&T Labs Research