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

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A022881 The number of numbers [ [ ix ]jx ] that equal n, where i >= 1, j >= 1 and x=sqrt(3). 0
1, 0, 1, 0, 2, 1, 0, 2, 0, 3, 0, 1, 2, 0, 2, 0, 3, 0, 1, 4, 0, 2, 0, 1, 4, 0, 2, 0, 2, 0, 3, 2, 0, 4, 0, 2, 0, 2, 1, 0, 6, 0, 3, 0, 2, 3, 0, 1, 0, 2, 6, 0, 2, 0, 3, 0, 2, 3, 0, 2, 0, 5, 0, 1, 3, 0, 4, 0, 5, 0, 2, 3, 0, 2, 0, 2, 5, 0, 2, 0, 1, 0, 7, 1, 0, 5, 0, 4, 0, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,5

LINKS

Table of n, a(n) for n=1..90.

CROSSREFS

Sequence in context: A287516 A252055 A097567 * A093201 A067613 A264034

Adjacent sequences:  A022878 A022879 A022880 * A022882 A022883 A022884

KEYWORD

nonn

AUTHOR

Clark Kimberling

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified November 21 16:08 EST 2017. Contains 295003 sequences.