Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A099767
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A099767 Number of n-digit palindromes in base n. +0
1
1, 6, 12, 100, 180, 2058, 3584, 52488, 90000, 1610510, 2737152, 57921708, 97883968, 2392031250, 4026531840, 111612119056, 187339329792, 5808378560022, 9728000000000 (list; graph; listen)
OFFSET

2,2

FORMULA

a(n) = (n - 1)*n^([(n + 1)/2] - 1) where [] is the greatest integer function

EXAMPLE

a(3) = 6 because there are 6 3-digit palindromes in base 3, namely 101, 111, 121, 202, 212, 222.

MATHEMATICA

(n - 1)*n^(Floor[(n + 1)/2] - 1) /. n -> Range[2, 20]

CROSSREFS

Sequence in context: A128953 A002898 A003613 this_sequence A080450 A095388 A038515

Adjacent sequences: A099764 A099765 A099766 this_sequence A099768 A099769 A099770

KEYWORD

easy,nonn

AUTHOR

Anonymous, Nov 11 2004

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 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research