The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A154281 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A154281

1,0,0,1 followed by 0,0,0...
(history; published version)

#12 by Joerg Arndt at Wed Jan 03 23:47:00 EST 2024

STATUS

editing

approved

#11 by Paolo P. Lava at Wed Jan 03 16:47:18 EST 2024

FORMULA

a(n)={C[(n-2)^2,n] mod 2}, with n>=1. - Paolo P. Lava, Jan 22 2009

STATUS

approved

editing

#10 by Alois P. Heinz at Sun Aug 05 12:13:28 EDT 2018

STATUS

proposed

approved

#9 by Andrew Howroyd at Sun Aug 05 12:10:21 EDT 2018

STATUS

editing

proposed

#8 by Andrew Howroyd at Sun Aug 05 12:02:33 EDT 2018

FORMULA

a(n)={C[(n-2)^2,n] mod 2}, with n>=1 [From _. - _Paolo P. Lava_, Jan 22 2009]

Multiplicative with a(2^2) = 1, a(2^e) = 0 for e<>2, a(p^e) = 0 for odd prime p. - Andrew Howroyd, Aug 05 2018

PROG

(PARI) a(n)={n==1 || n==4} \\ Andrew Howroyd, Aug 05 2018

KEYWORD

nonn,mult

STATUS

approved

editing

#7 by Harvey P. Dale at Mon Aug 06 17:51:16 EDT 2012

STATUS

editing

approved

#6 by Harvey P. Dale at Mon Aug 06 17:51:12 EDT 2012

MATHEMATICA

PadRight[{1, 0, 0, 1}, 120, 0] (* Harvey P. Dale, Aug 06 2012 *)

STATUS

approved

editing

#5 by Russ Cox at Fri Mar 30 18:53:43 EDT 2012

FORMULA

a(n)={C[(n-2)^2,n] mod 2}, with n>=1 [From _Paolo P. Lava (paoloplava(AT)gmail.com), _, Jan 22 2009]

Discussion

Fri Mar 30

18:53

OEIS Server: https://oeis.org/edit/global/262

#4 by Russ Cox at Fri Mar 30 18:53:09 EDT 2012

AUTHOR

_Mats Granvik (mats.granvik(AT)abo.fi), _, Jan 06 2009

Discussion

Fri Mar 30

18:53

OEIS Server: https://oeis.org/edit/global/263

#3 by T. D. Noe at Wed Sep 28 20:50:34 EDT 2011

FORMULA

a(n)={C[(n-2)^2,n] mod 2}, with n>=1 [From Paolo P. Lava (pplpaoloplava(AT)splgmail.atcom), Jan 22 2009]

Discussion

Wed Sep 28

20:50

OEIS Server: https://oeis.org/edit/global/96