Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A051846
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A051846 Digits 1..n in strict descending order n..1 interpreted in base n+1. +0
4
1, 7, 57, 586, 7465, 114381, 2054353, 42374116, 987654321, 25678050355, 736867805641, 23136292864686, 789018236134297, 29043982525261081, 1147797409030816545, 48471109094902544776, 2178347851919531492065 (list; graph; listen)
OFFSET

1,2

COMMENT

All odd-indexed (2n+1) terms are divisible by (2n+1). See A051847.

FORMULA

a(n) = sum(i*((n+1)^(i-1)), i=1..n)

a(n)=A062806(n+1)/(n+1)-(n+1)^(n+1); a(n)=((n+1)^(n+1)*(n-1) + 1)/n^2 - Benoit Cloitre (benoit7848c(AT)orange.fr), Sep 28 2002

EXAMPLE

a(1) = 1, a(2) = 2*3 + 1 = 7, a(3) = 3*(4^2) + 2*4 + 1 = 57, a(4) = 4*(5^3) + 3*(5^2) + 2*5 + 1 = 586

MAPLE

a(n) := proc(n) local i; add(i*((n+1)^(i-1)), i=1..n); end;

PROGRAM

(PARI) a(n)=((n+1)^(n+1)*(n-1) + 1)/n^2

CROSSREFS

The right edge of A051845. Cf. also A023811.

Sequence in context: A082413 A062192 A122649 this_sequence A051816 A015566 A006193

Adjacent sequences: A051843 A051844 A051845 this_sequence A051847 A051848 A051849

KEYWORD

easy,nonn

AUTHOR

Antti Karttunen Dec 13 1999

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 September 7 15:23 EDT 2008. Contains 143483 sequences.


AT&T Labs Research