Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A077062
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A077062 Minimal k(n) such n^2+k(n)^2 is a full cube for k>n; k(n)=0 if no such k exists. +0
4
8, 0, 11, 0, 0, 10, 0, 524, 0, 46, 30, 0, 0, 0, 0, 0, 88, 68, 26, 0, 0, 0, 0, 0, 0, 0, 39, 2935 (list; graph; listen)
OFFSET

0,1

FORMULA

n^2+k^2=c^3, k>n.

EXAMPLE

k(0)=8 because 0^2+8^2=4^3; k(2)=11 because 2^2+11^2=5^3.

CROSSREFS

Cf. A076600, A077059-A077062.

Sequence in context: A019937 A070489 A112268 this_sequence A022900 A028652 A028636

Adjacent sequences: A077059 A077060 A077061 this_sequence A077063 A077064 A077065

KEYWORD

nonn

AUTHOR

Zak Seidov (zakseidov(AT)yahoo.com), Oct 23 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 December 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research