login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A144407 A058529(n+1)^2. 2

%I #16 Feb 15 2020 14:31:28

%S 49,289,529,961,1681,2209,2401,5041,5329,6241,7921,9409,10609,12769,

%T 14161,16129,18769,22801,25921,27889,36481,37249,39601,47089,49729,

%U 54289,57121,58081,66049,69169,73441,78961,82369,83521,96721,97969

%N A058529(n+1)^2.

%C The last digit is either 1 or 9 .

%H Ray Chandler, <a href="/A144407/b144407.txt">Table of n, a(n) for n = 1..10000</a>

%H M. de Frenicle, <a href="http://gallica.bnf.fr/ark:/12148/bpt6k5493994j/">Methode pour trouver la solutions des problemes par les exclusions</a>, in: Divers ouvrages des mathematiques et de physique par messieurs de l'academie royale des sciences, (1693) pp 1-44.

%t Select[Range[500], Union[Abs[Mod[FactorInteger[#][[All, 1]], 8, -1]]] == {1} &]^2 // Rest (* _Jean-François Alcover_, Sep 21 2015, after _T. D. Noe_ *)

%Y Cf. A058529, A198437.

%K nonn

%O 1,1

%A _Paul Curtz_, Sep 30 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 8 03:32 EDT 2024. Contains 372317 sequences. (Running on oeis4.)