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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A104896 a(0)=0; a(n) = 7*a(n-1) + 7. 0
0, 7, 56, 399, 2800, 19607, 137256, 960799, 6725600, 47079207, 329554456, 2306881199, 16148168400, 113037178807, 791260251656, 5538821761599 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

Conjecture: this is also the number of integers from 0 to 10^n - 1 that lack 0, 1 and 2 as a digit.

Number of monic irreducible polynomials of degree 1 in GF(7)[x1,...,xn]. - Max Alekseyev (maxale(AT)gmail.com), Jan 23 2006

FORMULA

a(n) = (7^(n+1) - 7) / 6 - Max Alekseyev (maxale(AT)gmail.com), Jan 23 2006

a(n) = 7^n+a(n-1) (with a(0)=0). [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Nov 13 2010]

MAPLE

a:=n->sum (7^j, j=1..n): seq(a(n), n=0..15); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Oct 03 2007

CROSSREFS

Cf. A052386, A052379, A000918, A029858, A080674.

Sequence in context: A180287 A082140 A054614 * A122996 A092315 A092318

Adjacent sequences:  A104893 A104894 A104895 * A104897 A104898 A104899

KEYWORD

easy,nonn

AUTHOR

Alexandre Wajnberg (alexandre.wajnberg(AT)ulb.ac.be), Apr 24 2005

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 17 08:44 EST 2012. Contains 205998 sequences.