Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A123865
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A123865 n^4 - 1. +0
9
0, 15, 80, 255, 624, 1295, 2400, 4095, 6560, 9999, 14640, 20735, 28560, 38415, 50624, 65535, 83520, 104975, 130320, 159999, 194480, 234255, 279840, 331775, 390624, 456975, 531440, 614655, 707280, 809999, 923520, 1048575, 1185920, 1336335 (list; graph; listen)
OFFSET

1,2

COMMENT

a(n) mod 5 = 0 iff n mod 5 > 0: a(A008587(n)) = 4; a(A047201(n)) = 0; a(n) mod 5 = 4*(1-A079998(n)).

A129292(n) = number of divisors of a(n) that are not greater than n. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 09 2007

MAPLE

with (combinat):seq(fibonacci(3, n^2)-2, n=1..34); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), May 25 2008

CROSSREFS

Cf. A024002, A000583, A005563, A123866, A123867, A123868.

Sequence in context: A085808 A033594 A059377 this_sequence A024002 A050149 A055815

Adjacent sequences: A123862 A123863 A123864 this_sequence A123866 A123867 A123868

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 16 2006

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 November 30 22:12 EST 2008. Contains 150989 sequences.


AT&T Labs Research