Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A165776
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A165776 n + (least square > n), i.e., n + A048761(n+1). +0
1
1, 5, 6, 7, 13, 14, 15, 16, 17, 25, 26, 27, 28, 29, 30, 31, 41, 42, 43, 44, 45, 46, 47, 48, 49, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 145, 146 (list; graph; listen)
OFFSET

0,2

FORMULA

a(n) = A001477(n) + A048761(n+1)

EXAMPLE

a(4)= 13 = 4+9 because 9 is the least square > 4.

PROGRAM

(PARI) A165776(n)=n+(sqrtint(n)+1)^2

CROSSREFS

Cf. A165775.

Sequence in context: A047320 A011761 A106745 this_sequence A003273 A006991 A047574

Adjacent sequences: A165773 A165774 A165775 this_sequence A165777 A165778 A165779

KEYWORD

easy,nonn

AUTHOR

M. F. Hasler (MHasler(AT)univ-ag.fr), Oct 05 2009

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 November 23 10:40 EST 2009. Contains 167421 sequences.


AT&T Labs Research