Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A130697
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A130697 Numbers n such that the sum of the Euler functions of integers up to n is a square. +0
1
1, 3, 14, 32, 54, 1458, 3765, 5343, 10342, 57918, 72432, 134072 (list; graph; listen)
OFFSET

1,2

COMMENT

In the preprint listed below it is shown that the sequence (a(n))_n is of asymptotic density zero as a subset of the positive integers. It is not known if the sequence is infinite.

REFERENCES

F. Luca and A. Sankaranarayanan, On numbers n such that phi(1)+...+phi(n) is a square, preprint, 2007.

FORMULA

Numbers n such that phi(1)+phi(2)+...+phi(n)=x^2 with some integer x.

EXAMPLE

a(3)=14 since phi(1)+phi(2)+phi(3)+phi(4)+phi(5)+phi(6)+phi(7)+phi(8)+phi(9)+phi(10)+phi(11)+phi(12)+phi(14)=64=8^2

MATHEMATICA

T=0; For[l = 1, l < 1000000, l++, T = T + EulerPhi[l]; If[T == Floor[Sqrt[T]]^2, Print[l, " ", Floor[Sqrt[T]]]]]

CROSSREFS

Sequence in context: A014696 A071396 A032525 this_sequence A033991 A081269 A140064

Adjacent sequences: A130694 A130695 A130696 this_sequence A130698 A130699 A130700

KEYWORD

nonn

AUTHOR

Florian Luca (fluca(AT)matmor.unam.mx), Jul 11 2007

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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research