Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A106033
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A106033
%S A106033 2,3,1,8,9,3,2,17,18,34,20,40,43,23,24,52,21,58,23,24,67,26,27,73,75,78,
%T A106033 28,29,88,91,32,33,103,35,114,40,120,47,48,136,57,142,68,157,160,62,83,
%U A106033 112,113,214,217,116,223,135,26,156,43,158,41,40,161,59,259,260,104,103
%N A106033 a(n) is the least number such that n*prime(n)+a(n) is a perfect square.
%F A106033 a(n)=(floor[sqrt[n*prime(n)]]+1)^2-n*prime(n)
%e A106033 a(10)=34 because 10*prime(10)+a(n)=10*29+34=324=18^2
%t A106033 a[n_]:=(Floor[Sqrt[n*Prime[n]]]+1)^2-n*Prime[n]
%Y A106033 Sequence in context: A078298 A096063 A101281 this_sequence A121634 A006015 
               A110292
%Y A106033 Adjacent sequences: A106030 A106031 A106032 this_sequence A106034 A106035 
               A106036
%K A106033 nonn
%O A106033 1,1
%A A106033 Zak Seidov (zakseidov(AT)yahoo.com), May 05 2005

    
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 6 22:55 EST 2009. Contains 170429 sequences.


AT&T Labs Research