Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A033618
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A033618 Number of ways n-th repdigit number (A010785[ n ]) can be expressed as a polygonal number. +0
1
2, 2, 2, 2, 3, 2, 2, 3, 2, 3, 3, 2, 4, 5, 2, 3, 3, 4, 3, 4, 3, 4, 5, 3, 3, 3, 3, 2, 3, 3, 3, 6, 3, 2, 3, 2, 3, 3, 3, 3, 4, 2, 3, 3, 7, 3, 4, 3, 4, 5, 4, 3, 4, 2, 2, 3, 3, 3, 4, 3, 3, 3, 3, 4, 3, 2, 3, 6, 2, 3, 3 (list; graph; listen)
OFFSET

2,1

LINKS

M. Keith, On Repdigit Polygonal Numbers, J. Integer Sequences, Vol. 1, 1998, #6.

EXAMPLE

The n-th k-sided polygonal number is P(n,k)=n((k-2)n+4-k)/2 (k >= 2, n >= 1). For each repdigit number R>=2, sequence gives number of (n,k) such that P(n,k)=R.

CROSSREFS

Sequence in context: A074592 A089993 A047931 this_sequence A061357 A138139 A127992

Adjacent sequences: A033615 A033616 A033617 this_sequence A033619 A033620 A033621

KEYWORD

nonn

AUTHOR

Mike Keith (domnei(AT)aol.com)

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 December 1 13:27 EST 2009. Contains 167806 sequences.


AT&T Labs Research