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!)
A087361 For n > 2, a(n) = smallest square > a(n-1) and congruent to a(n-1) (mod a(n-2)). 1
1, 4, 9, 25, 169, 1369, 17424, 1530169, 10067929, 2331716784016, 20982766683025, 84954282130303718617809, 1071969624008488268518009, 313250759663896347514851738121261643934677776 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
EXAMPLE
a(6) == a(5) (mod a(4)).
1444 == 169 (mod 25).
1369 equals 169 (mod 25).
CROSSREFS
Cf. A087362.
Sequence in context: A087374 A081948 A191273 * A340642 A090117 A329125
KEYWORD
nonn
AUTHOR
Amarnath Murthy, Sep 08 2003
EXTENSIONS
More terms from David Wasserman, May 23 2005
STATUS
approved

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 April 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)