Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A045502
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A045502 2n+1 and 3n+1 are squares. +0
1
0, 40, 3960, 388080, 38027920, 3726348120, 365144087880, 35780394264160, 3506113493799840, 343563341998120200, 33665701402321979800, 3298895174085555900240, 323258061358982156243760 (list; graph; listen)
OFFSET

0,2

REFERENCES

R. S. Luthar, Problem E2606, Amer. Math. Monthly, 84 (1977), 823-824.

MATHEMATICA

f[ 0 ]=0; f[ 1 ]=2; f[ n_ ] := f[ n ]=10f[ n-1 ]-f[ n-2 ]; a[ n_ ] := f[ n ]f[ n+1 ]

CROSSREFS

Cf. A001078.

Sequence in context: A003741 A049215 A059948 this_sequence A123810 A119525 A123381

Adjacent sequences: A045499 A045500 A045501 this_sequence A045503 A045504 A045505

KEYWORD

nonn,easy

AUTHOR

Fred Schwab (fschwab(AT)nrao.edu)

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