Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A068793
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A068793 sum{i*(n^(n-i-1)+n^(n+i-1)) | 1<=i<n}. +0
2
5, 194, 14619, 1831444, 348288905, 94197694758, 34466324363639, 16416600747716168, 9876543210123456789, 7326247444821284733610, 6569987372181208872192659, 7007407167541356868004228892 (list; graph; listen)
OFFSET

2,1

COMMENT

a(n)=A062813(n)*n^(n-1)+A023811(n).

a(n) is a palindrome in base n representation for all n.

FORMULA

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

EXAMPLE

a(2) = 5 = (101)BIN;

a(8) = 34466324363639 = (765432101234567)OCT;

a(10) = 9876543210123456789;

a(16) = 21173125052858393282329502187520773615 = (FEDC...876543210123456789ABCDEF)HEX.

CROSSREFS

Cf. A068792.

Sequence in context: A086124 A100760 A093154 this_sequence A142927 A114351 A080927

Adjacent sequences: A068790 A068791 A068792 this_sequence A068794 A068795 A068796

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Mar 04 2002

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 4 21:24 EDT 2008. Contains 143414 sequences.


AT&T Labs Research