Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A139128
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A139128 Number of distinct representations A005244(n)=A005244(i)*A005244(j)-1. +0
3
0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3 (list; graph; listen)
OFFSET

1,28

COMMENT

A139129 gives the smallest terms in A005244 having exactly n

representations.

LINKS

R. Zumkeller, Table of n, a(n) for n = 1..500

Eric Weisstein's World of Mathematics, Hofstadter Sequences

Index entries for Hofstadter-type sequences

EXAMPLE

A005244(28) = 129: a(28) = #{26*5-1,65*2-1} = 2.

CROSSREFS

Sequence in context: A093518 A128184 A025450 this_sequence A106752 A136441 A030561

Adjacent sequences: A139125 A139126 A139127 this_sequence A139129 A139130 A139131

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 09 2008

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