cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

User: Omar Antolín-Camarena

Omar Antolín-Camarena's wiki page.

Omar Antolín-Camarena has authored 2 sequences.

A354069 Number of vertices in the iterated clique graphs of the 1-skeleton of the snub disphenoid.

Original entry on oeis.org

8, 12, 20, 56, 1076
Offset: 0

Views

Author

Omar Antolín-Camarena, May 16 2022

Keywords

Comments

It is unknown if this sequence is unbounded (the sequence of orders of the iterated clique graphs of a graph is either unbounded or eventually periodic).

Links

Crossrefs

Cf. A299028, A299030.

A072378 Numbers n such that 12*n divides F(12*n), where F(m) is the m-th Fibonacci number.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 14, 15, 16, 18, 20, 24, 25, 27, 28, 30, 32, 36, 40, 42, 45, 46, 48, 50, 51, 54, 55, 56, 57, 60, 64, 70, 72, 75, 80, 81, 84, 90, 92, 96, 98, 100, 102, 108, 110, 112, 114, 120, 125, 126, 128, 135, 138, 140, 144, 150, 153, 155, 160, 162, 165
Offset: 1

Views

Author

Omar Antolin Camarena (omar(AT)tlahui.posgrado.unam.mx), Jul 19 2002

Keywords

Comments

Odd integers n such that n divides the n-th Fibonacci number form sequence A129066, while even such n's are multiples of 12.
a(n) seems to be asymptotic to a constant multiple of n^phi, where phi is the golden ratio.

Examples

			3 belongs to the sequence because 3*12=36 divides F(36) = 14930352. For every n, 5^n belongs to the sequence, as can be proved by induction.

Links

Crossrefs

Cf. A128974, A317971.

Programs

  • Mathematica
    Select[Range[n], Mod[Fibonacci[12# ], 12# ]==0&]

Extensions

Edited by Max Alekseyev, Jan 21 2010

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.